533 search results - page 40 / 107 » Playing games with approximation algorithms |
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Learning algorithms often obtain relatively low average payoffs in repeated general-sum games between other learning agents due to a focus on myopic best-response and one-shot Nas...
ETRA
2006
ACM
14 years 1 months ago
2006
ACM
Next-generation immersive virtual environments and video games will require virtual agents with human-like visual attention and gaze behaviors. A critical step is to devise effic...