Sciweavers

206 search results - page 22 / 42
» Computing Equilibria in Anonymous Games
Sort
View
FOCS
2009
IEEE
14 years 1 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
ECAL
2003
Springer
13 years 12 months ago
Meta-evolutionary Game Dynamics for Mathematical Modelling of Rules Dynamics
This paper proposes an evolutionary-game-theory model, called meta-evolutionary game dynamics, for studying the dynamics of rules and individual behaviour. Although there are two g...
Takashi Hashimoto, Yuya Kumagai
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 5 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
ICML
2007
IEEE
14 years 7 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
ATAL
2007
Springer
14 years 29 days ago
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, rational agents to form stable teams. Furthermore, the study of coalitional stability conc...
Georgios Chalkiadakis, Evangelos Markakis, Craig B...