3504 search results - page 19 / 701 » Computational Aspects of Equilibria |
153
click to vote
AAAI
2007
15 years 8 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
143
click to vote
IJCAI
2003
15 years 7 months ago
2003
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
168
click to vote
FOCS
2008
IEEE
15 years 6 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...
153
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
235
click to vote
WINE
2010
Springer
15 years 3 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...