scientific article; zbMATH DE number 7730611

DOI10.4230/LIPICS.CONCUR.2021.9MaRDI QIDQ6176102zbMATH OpenFDO

Authors Shibashis Guha, Jean-François Raskin

Publication date 21 August 2023

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

zbMATH Keywords

mean-payoffStackelberg gamessynthesis

Mathematics Subject Classification ID

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

Recommendations

• Robust equilibria in mean-payoff games
• Addressing scalability and robustness in security games with multiple boundedly rational adversaries
• Playing Against Fair Adversaries in Stochastic Games with Total Rewards
• On the robustness of learning in games with stochastically perturbed payoff observations
• Algorithms for a risk-averse Stackelberg game with multiple adversaries
• Robustness of Learning in Games With Heterogeneous Players
• A graphic measure for game-theoretic robustness
• Robustness of dynamics in games: a contraction mapping decomposition approach
• Distributionally robust equilibrium for continuous games: Nash and Stackelberg models

Cited in

(3)

• A game-theoretic approach for the synthesis of complex systems
• Stackelberg-Pareto synthesis
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete

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 Q6176102)