Approachability in repeated games: Computational aspects and a Stackelberg variant
We consider a finite two-player zero-sum game with vector-valued rewards. We study the question of whether a given polyhedral set D is "approachable," that is, whether Player 1 (the "decision maker") can guarantee that the long-term average reward belongs to D, for any strategy o...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier,
2010-02-10T19:53:04Z.
|
| Subjects: | |
| Online Access: | Get fulltext |