Learning in Stackelberg Games with Non-myopic Agents
Abstract
References
Index Terms
- Learning in Stackelberg Games with Non-myopic Agents
Recommendations
Stackelberg Security Games with Multiple Uncoordinated Defenders
AAMAS '18: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent SystemsStackelberg security games have received much attention in recent years. While most existing work focuses on single-defender settings, there are many real-world scenarios that involve multiple defenders (e.g., multi-national anti-crime actions in ...
On Stackelberg Strategies in Affine Congestion Games
We investigate the efficiency of some Stackelberg strategies in congestion games with affine latency functions. A Stackelberg strategy is an algorithm that chooses a subset of players and assigns them a prescribed strategy with the purpose of mitigating ...
Comments
Information & Contributors
Information
Published In
- General Chair:
- David M. Pennock,
- Program Chairs:
- Ilya Segal,
- Sven Seuken
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 470Total Downloads
- Downloads (Last 12 months)284
- Downloads (Last 6 weeks)25
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in