5995 search results - page 103 / 1199 » Algorithmic Game Theory |
132
Voted
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...
129
Voted
SIGECOM
2010
ACM
15 years 3 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
136
Voted
AMIRE
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents two strategies for selecting volitional facial expressions and gaze behaviors of animated agents, in the case of Online Negotiation and Soft Game Theory. It is ...
155
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
127
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...