Near-Optimal Online Egalitarian learning in General Sum Repeated Matrix Games
Author(s)
Date issued
June 4, 2019
In
Computing Research Repository (CoRR)
Vol
1906.01609
Subjects
cs.LG cs.GT
Abstract
We study two-player general sum repeated finite games where the rewards of each player are generated from an unknown distribution. Our aim is to find the egalitarian bargaining solution (EBS) for the repeated game, which can lead to much higher rewards than the maximin value of both players. Our most important contribution is the derivation of an algorithm that achieves simultaneously, for both players, a high-probability regret bound of order O(lnT−−−√3⋅T2/3) after any T rounds of play. We demonstrate that our upper bound is nearly optimal by proving a lower bound of Ω(T2/3) for any algorithm.
Publication type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
1906.01609.pdf
Type
Main Article
Size
349.17 KB
Format
Adobe PDF
Checksum
(MD5):2f3f41663a29f59e5f79f81bca0c06ed