Sciweavers

179 search results - page 29 / 36
» On Learning Algorithms for Nash Equilibria
Sort
View
SAGA
2007
Springer
15 years 3 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
ICS
2010
Tsinghua U.
15 years 6 months ago
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
A Cryptographic Solution to a Game Theoretic Problem
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...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
INFOCOM
2000
IEEE
15 years 1 months ago
Distributed Power Control and Spreading Gain Allocation in CDMA Data Networks
We study the radio resource allocation problem of distributed joint transmission power control and spreading gain allocation in a DS-CDMA mobile data network. The network consists...
Seong-Jun Oh, Tava Lennon Olsen, Kimberly M. Wasse...
ATAL
2007
Springer
15 years 3 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein