79 search results - page 4 / 16 » Deliberation in Equilibrium: Bargaining in Computationally C... |
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
72
Voted
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
102
click to vote
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
104
click to vote
SIGECOM
2011
ACM
14 years 15 days ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...