PRALINE: A tool for computing Nash equilibria in concurrent games. We present PRALINE, which is the first tool to compute Nash equilibria in games played over graphs. We consider concurrent games: at each step, players choose their actions independently. There can be an arbitrary number of players. The preferences of the players are given by payoff functions that map states to integers, the goal for a player is then to maximize the limit superior of her payoff; this can be seen as a generalization of Büchi objectives. PRALINE looks for pure Nash equilibria in these games. It can construct the strategies of the equilibrium and users can play against it to test the equilibrium. We give the idea behind its implementation and present examples of its practical use.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Gutierrez, Julian; Najib, Muhammad; Perelli, Giuseppe; Wooldridge, Michael: Automated temporal equilibrium analysis: verification and synthesis of multi-player games (2020)
- Gutierrez, Julian; Harrenstein, Paul; Perelli, Giuseppe; Wooldridge, Michael: Nash equilibrium and bisimulation invariance (2019)
- Pancerz, Krzysztof; Schumann, Andrew: Slime mould games based on rough set theory (2018)
- Svoreňová, Mária; Kwiatkowska, Marta: Quantitative verification and strategy synthesis for stochastic games (2016)
- Bouyer, Patricia; Brenguier, Romain; Markey, Nicolas; Ummels, Michael: Pure Nash equilibria in concurrent deterministic games (2015)
- Toumi, Alexis; Gutierrez, Julian; Wooldridge, Michael: A tool for the automated verification of Nash equilibria in concurrent games (2015)
- Brenguier, Romain: PRALINE: a tool for computing Nash equilibria in concurrent games (2013) ioport