scientific article; zbMATH DE number 7730610

DOI10.4230/LIPICS.CONCUR.2021.8MaRDI QIDQ6176100zbMATH OpenFDO

Authors Jean-François Raskin, Bogaard Marie van Den

Publication date 21 August 2023

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

zbMATH Keywords

games on graphsmean-payoff objectivessubgame-perfect equilibria

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(16)

• Subgame perfect reaction function equilibria in discounted duopoly supergames are trivial
• Subgame perfect equilibria in model with bargaining costs varying in time
• Subgame perfect equilibria in majoritarian bargaining
• A game-theoretic approach for the synthesis of complex systems
• Subgame-perfect cooperation in an extensive game
• Subgame perfect equilibria in stopping games
• A characterization of sub-game perfect equilibria for SDEs of mean-field type
• Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
• Subgame perfect implementation of the deserving winner of a competition with natural mechanisms
• -subgame perfectness of an open-loop Stackelberg equilibrium in linear-state games
• Stackelberg-Pareto synthesis
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• Characterising and verifying the core in concurrent multi-player mean-payoff games
• As soon as possible but rationally
• A game of pawns
• Subbalanced games and bargaining sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176100)