14 search results - page 1 / 3 » An Approximate Subgame-Perfect Equilibrium Computation Techn... |
AAAI
2010
13 years 6 months ago
2010
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...
AMAI
2006
Springer
13 years 5 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called netwo...
SIGECOM
2010
ACM
13 years 5 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....
SODA
2010
ACM
13 years 3 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...