• Corpus ID: 246240205

Correlated Equilibria and Fairness in Concurrent Stochastic Games

  title={Correlated Equilibria and Fairness in Concurrent Stochastic Games},
  author={M. Kwiatkowska and Gethin Norman and David Anthony Parker and Gabriel Santos},
  booktitle={International Conference on Tools and Algorithms for Construction and Analysis of Systems},
. Game-theoretic techniques and equilibria analysis facilitate the design and verification of competitive systems. While algorithmic complexity of equilibria computation has been extensively studied, practical implementation and application of game-theoretic methods is more recent. Tools such as PRISM-games support automated verification and synthesis of zero-sum and ( ε -optimal subgame-perfect) social welfare Nash equilibria properties for concurrent stochastic games. However, these methods… 

Figures and Tables from this paper

Probabilistic Model Checking for Strategic Equilibria-based Decision Making: Advances and Challenges

An overview of recent advances in developing a modelling, verification and strategy framework for concurrent stochastic games implemented in the probabilistic model checker PRISM-games and the key concepts, logics and algorithms and the currently available tool support are outlined.

Finite-horizon Equilibria for Neuro-symbolic Concurrent Stochastic Games

We present novel techniques for neuro-symbolic concurrent stochastic games, a recently proposed modelling formalism to represent a set of probabilistic agents operating in a continuous-space



Multi-player Equilibria Verification for Concurrent Stochastic Games

An extension of the temporal logic rPATL (probabilistic alternating-time temporal logic with rewards) is presented to specify equilibria-based properties for any number of distinct coalitions, and a corresponding model checking algorithm for a variant of stopping games.

Automatic verification of concurrent stochastic systems

This paper proposes an extension of the temporal logic rPATL for specifying quantitative properties in concurrent stochastic games (CSGs), and considers (social welfare) Nash equilibria, to formally identify scenarios where two players or coalitions with distinct goals can collaborate to optimise their joint performance.

PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games

PRALINE is presented, which is the first tool to compute Nash equilibria in games played over graphs, and can construct the strategies of the equilibrium and users can play against it to test the equilibrium.

An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees

A novel polynomial-time algorithm is provided that explicitly reasons about stochastic decisions in two-player complete-information game trees and is used in an example card game.

PRISM-games 3.0: Stochastic Game Verification with Concurrency, Equilibria and Time

A major new release of the PRISM-games model checker, featuring multiple significant advances in its support for verification and strategy synthesis of stochastic games, and summarises the performance and scalability of the tool.

Incorporating Fairness into Game Theory and Economics

People like to help those who are helping them and to hurt those who are hurting them. Outcomes rejecting such motivations are called fairness equilibria. Outcomes are mutual-max when each person

A reduction from parity games to simple stochastic games

This paper presents a simple, direct and efficient reduction from deterministic parity games to simple stochastic games: it yields an arena whose size is linear up to a logarithmic factor in size of the original arena.

Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness

This work considers fixpoint algorithms for two-player games on graphs with Rabin winning conditions, where the environment is constrained by a strong transition fairness assumption, and shows that GR(1) specifications with strong transition unfair assumption can be solved in O(n3) time.

Theory of Games and Economic Behavior

THIS book is based on the theory that the economic man attempts to maximize his share of the world's goods and services in the same way that a participant in a game involving many players attempts to

Automatic verification of competitive stochastic systems

The applicability and efficiency of the methods are demonstrated by deploying them to analyse and detect potential weaknesses in a variety of large case studies, including algorithms for energy management in Microgrids and collective decision making for autonomous systems.