80 search results - page 13 / 16 » Existence of Nash Equilibria in Selfish Routing Problems |
AAAI
2010
13 years 7 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
CRYPTO
2000
Springer
13 years 12 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
We consider a model of content contribution in peer-to-peer networks with linear quadratic payoffs and very general interaction patterns. We find that Nash equilibria of this gam...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Infinite-horizon multi-agent control processes with nondeterminism and partial state knowledge have particularly interesting properties with respect to adaptive control, ...