Computer aided synthesis: a game-theoretic approach

DOI10.1007/978-3-319-62809-7_1zbMath1494.91033arXiv1706.00652OpenAlexW2620600492MaRDI QIDQ2408790

Véronique Bruyère

Publication date: 13 October 2017

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

zbMATH Keywords

synthesisNash equilibriumwinning strategygames played on graphsBoolean objectivequantitative objective

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Formal languages and automata (68Q45)

Related Items (16)

Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games ⋮ Individual upper semicontinuity and subgame perfect \(\epsilon\)-equilibria in games with almost perfect information ⋮ Reachability and safety objectives in Markov decision processes on long but finite horizons ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Subgame-perfect Equilibria in Mean-payoff Games (journal version) ⋮ Unnamed Item ⋮ On the existence of weak subgame perfect equilibria ⋮ On subgame perfect equilibria in turn-based reachability timed games ⋮ Perfect information games where each player acts only once ⋮ Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives ⋮ On relevant equilibria in reachability games ⋮ Subgame perfection in recursive perfect information games ⋮ Subgame maxmin strategies in zero-sum stochastic games with tolerance levels ⋮ Unnamed Item ⋮ A game-theoretic approach for the synthesis of complex systems

This page was built for publication: Computer aided synthesis: a game-theoretic approach