1410 search results - page 35 / 282 » The Algorithmics of Solitaire-Like Games |
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
81
Voted
FUN
2010
Springer
15 years 2 months ago
2010
Springer
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
73
Voted
ALDT
2009
Springer
15 years 4 months ago
2009
Springer
Most work in game theory is conducted under the assumption that the players are expected utility maximizers. Expected utility is a very tractable decision model, but is prone to w...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...