79 search results - page 11 / 16 » Deliberation in Equilibrium: Bargaining in Computationally C... |
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
FOCS
2008
IEEE
14 years 9 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...