The complexity of synthesizing uniform strategies

zbMATH Open1464.91025arXiv1303.0798MaRDI QIDQ3388751FDOQ3388751

Sophie Pinchinat, Laura Bozzelli, Bastien Maubert

Publication date: 6 May 2021

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

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

Mathematics Subject Classification ID

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

Cited In (3)

• Time-aware uniformization of winning strategies
• The Complexity of Eliminating Dominated Strategies
• Finding Uniform Strategies for Multi-agent Systems

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)