14 search results - page 2 / 3 » Computing Equilibria in Two-Player Timed Games via Turn-Base... |
DIALM
2003
ACM
13 years 10 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
AAAI
2006
13 years 6 months ago
2006
We analyze the asymptotic behavior of agents engaged in an infinite horizon partially observable stochastic game as formalized by the interactive POMDP framework. We show that whe...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
JSAC
2008
13 years 4 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
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....