Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash.
Yakov BabichenkoChristos H. PapadimitriouAviad RubinsteinPublished in: CoRR (2015)
Keyphrases
- approximation algorithms
- years ago
- nash equilibrium
- nash equilibria
- utility function
- game theory
- equilibrium strategies
- social welfare
- np hard
- neural network
- bargaining solution
- cooperative game
- special case
- fixed point
- probability distribution
- evolutionary game
- scheduling problem
- domain knowledge
- association rules
- multi agent systems
- cooperative
- multi agent
- bayesian networks
- high quality
- case study
- decision making
- machine learning