The complexity of synthesizing uniform strategies

MaRDI QIDQ3388751zbMATH OpenFDO

Authors Bastien Maubert, Sophie Pinchinat, Laura Bozzelli

Publication date 6 May 2021

Full work available at URL https://arxiv.org/abs/1303.0798, http://eptcs.web.cse.unsw.edu.au/paper.cgi?SR.17

Mathematics Subject Classification ID

Applications of game theory (91A80) Agent technology and artificial intelligence (68T42) Games involving graphs (91A43) Temporal logic (03B44)

Recommendations

• A general notion of uniform strategies
• Uniform strategies, rational relations and jumping automata
• Jumping Automata for Uniform Strategies
• On the synthesis of strategies in infinite games
• Finding Uniform Strategies for Multi-agent Systems

Cited in

(5)

• The Complexity of Eliminating Dominated Strategies
• Uniform strategies, rational relations and jumping automata
• A general notion of uniform strategies
• Finding Uniform Strategies for Multi-agent Systems
• Time-aware uniformization of winning strategies

This page was built for publication: The complexity of synthesizing uniform strategies

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