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...
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...
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...
—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...
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 ...