533 search results - page 57 / 107 » Playing games with approximation algorithms |
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
AAAI
2008
13 years 10 months ago
2008
In complex strategic situations decision-making agents interact with many other agents and have access to many pieces of information throughout their play. This usually leads to g...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
We analyze a heads-up no-limit Texas Hold’em poker tournament with a fixed small blind of 300 chips, a fixed big blind of 600 chips and a total amount of 8000 chips on the tab...