Multiplayer Cost Games with Simple Nash Equilibria

DOI10.1007/978-3-642-35722-0_5zbMath1422.91043arXiv1210.3548OpenAlexW1533793804MaRDI QIDQ3455836

Julie De Pril, Sven Schewe, Thomas Brihaye

Publication date: 11 December 2015

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3548

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) (n)-person games, (n>2) (91A06)

Related Items (9)

Extending finite-memory determinacy to multi-player games ⋮ Incentive Stackelberg Mean-Payoff Games ⋮ Unnamed Item ⋮ Subgame-perfect Equilibria in Mean-payoff Games (journal version) ⋮ Unnamed Item ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ On relevant equilibria in reachability games ⋮ Unnamed Item ⋮ A game-theoretic approach for the synthesis of complex systems

Cites Work

• Unnamed Item
• Unnamed Item
• Borel determinacy
• Perfect information stochastic games and related classes
• Automata, logics, and infinite games. A guide to current research
• Nash Equilibria in Concurrent Priced Games
• Optimal strategy synthesis for request-response games
• Ranking Automata and Games for Prioritized Requirements
• Equilibria in Quantitative Reachability Games
• Nash Equilibria for Reachability Objectives in Multi-player Timed Games
• Better Quality in Synthesis through Quantitative Objectives
• Time-Optimal Winning Strategies for Poset Games
• On the synthesis of strategies in infinite games
• Church’s Problem and a Tour through Automata Theory
• Equilibrium points in n -person games

This page was built for publication: Multiplayer Cost Games with Simple Nash Equilibria