Robust Equilibria in Mean-Payoff Games

DOI10.1007/978-3-662-49630-5_13zbMath1475.68202OpenAlexW2469079116MaRDI QIDQ2811341

Romain Brenguier

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:97282fa9-0954-4768-b203-13af7cf0981a

Mathematics Subject Classification ID

Cooperative games (91A12) Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ A Note on Game Theory and Verification ⋮ Unnamed Item ⋮ Robust Equilibria in Mean-Payoff Games

Cites Work

• Unnamed Item
• Unnamed Item
• Strategy logic
• Pareto curves of multidimensional mean-payoff games
• The complexity of multi-mean-payoff and multi-energy games
• Robust Equilibria in Mean-Payoff Games
• Concurrent Games with Ordered Objectives
• What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
• Mixed Nash Equilibria in Concurrent Terminal-Reward Games
• The Complexity of Nash Equilibria in Limit-Average Games
• Alternating-time temporal logic
• Equilibria in Quantitative Reachability Games
• The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
• Distributed computing meets game theory
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Equilibrium points in n -person games
• Formal Methods for Components and Objects

This page was built for publication: Robust Equilibria in Mean-Payoff Games