Alternating Reachability Games with Behavioral and Revenue Objectives

DOI10.29007/NCLDMaRDI QIDQ5222974zbMATHOpenAlexFDO

Authors Orna Kupferman, Tami Tamir

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/ncld

zbMATH Keywords

game theoryNash equilibriumreachability gamesrational synthesis

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Equilibria in quantitative reachability games
• To reach or not to reach? Efficient algorithms for total-payoff games
• Reachability games for optimal multi-agent scheduling of tasks with variable durations
• Publication:4490387
• On equilibria in quantitative games with reachability/safety objectives
• Optimal reachability in divergent weighted timed games
• Nash equilibria for reachability objectives in multi-player timed games
• scientific article; zbMATH DE number 7561608

Cited in

(1)

• From reachability to temporal specifications in cost-sharing games

This page was built for publication: Alternating Reachability Games with Behavioral and Revenue Objectives

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