176 search results - page 15 / 36 » Decision Problems for Nash Equilibria in Stochastic Games |
130
click to vote
ICML
2000
IEEE
16 years 2 months ago
2000
IEEE
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
132
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
118
click to vote
CORR
2008
Springer
15 years 2 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...
131
click to vote
CSE
2009
IEEE
15 years 5 months ago
2009
IEEE
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
121
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...