Optimal private payoff manipulation against commitment in extensive-form games
From MaRDI portal
Publication:6665657
Recommendations
- Optimally Deceiving a Learning Leader in Stackelberg Games
- Computation of Stackelberg equilibria of finite sequential games
- Incentive compatible strategies for general Stackelberg games with incomplete information
- Learning and approximating the optimal strategy to commit to
- The value of commitment in Stackelberg games with observation costs
Cites work
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- Dynamic incentive-aware learning: robust pricing in contextual auctions
- Game-theoretic patrolling with dynamic execution uncertainty and a case study on a real transit system
- Learning and approximating the optimal strategy to commit to
- Multiagent Systems
- Optimal Auction Design
- Optimally Deceiving a Learning Leader in Stackelberg Games
- Settling the complexity of computing two-player Nash equilibria
- Tackling sequential attacks in security games
- The complexity of computing a Nash equilibrium
- The security of machine learning
- Watch and learn: optimizing from revealed preferences feedback
This page was built for publication: Optimal private payoff manipulation against commitment in extensive-form games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665657)