Incentive Stackelberg Mean-Payoff Games
From MaRDI portal
Publication:4571136
DOI10.1007/978-3-319-41591-8_21zbMath1390.91073arXiv1511.00188OpenAlexW2252677806MaRDI QIDQ4571136
Maram Sai Krishna Deepak, Ashutosh Trivedi, Anshul Gupta, Bharath Kumar Padarthi, Sven Schewe
Publication date: 6 July 2018
Published in: Software Engineering and Formal Methods (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00188
Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Faster algorithms for mean-payoff games
- A new polynomial-time algorithm for linear programming
- Games with secure equilibria
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
- On the Complexity of Nash Equilibria and Other Fixed Points
- The Complexity of Nash Equilibria in Limit-Average Games
- From Parity and Payoff Games to Linear Programming
- Multiplayer Cost Games with Simple Nash Equilibria
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- Equilibria in Quantitative Reachability Games
- A Non-cooperative Equilibrium for Supergames
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- Equilibrium points in n -person games
