This work formalizes the interaction between AI systems and users as a game with three players: a defender and an attacker that are computationally or informationally bounded, and an AI that provides public advice and is less constrained.
Ida Mattsson, Ratip Emin Berker, Emanuel Tewolde et al.· 0 citations
Most successes of superhuman game-playing algorithms are in games with discrete actions, yet in auctions, robotics, sports, or trading, actions are nearly continuous. Prior techniques either rely on expert-designed discretizations or are sample inefficient. We present a scalable policy-gradient algorithm for large sequ...
Ondrej Kubícek, Viliam Lisý, Tuomas Sandholm· 0 citations
This work extends the concept of gadget game, tabular technique for test-time search, to the reinforcement learning setting and formally proves that, unlike prior tabular algorithms, regularized policy-gradient algorithms limit possible strategy degradation caused by test-time reasoning, even without the gadget games.
Ondrej Kubícek, Viliam Lisý, Tuomas Sandholm· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.