Sciweavers

205 search results - page 1 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
ATAL
2009
Springer
14 years 3 days ago
Learning equilibria in repeated congestion games
While the class of congestion games has been thoroughly studied in the multi-agent systems literature, settings with incomplete information have received relatively little attenti...
Moshe Tennenholtz, Aviv Zohar
COLT
2008
Springer
13 years 7 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
EOR
2010
99views more  EOR 2010»
13 years 4 months ago
Repeated newsvendor game with transshipments under dual allocations
We study a repeated newsvendor game with transshipments. In every period n retailers face a stochastic demand for an identical product and independently place their inventory orde...
Xiao Huang, Greys Sosic
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
13 years 9 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
ATAL
2006
Springer
13 years 9 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen