Multiplayer Cost Games with Simple Nash Equilibria-Reference-Cited by-同舟云学术

Multiplayer Cost Games with Simple Nash Equilibria

Published:2013 Issue: Volume: Page:59-73
ISSN:0302-9743
Container-title:Logical Foundations of Computer Science
language:
Short-container-title:

Author:

Brihaye Thomas,De Pril Julie,Schewe Sven

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-35722-0_5

Reference27 articles.

1. Lecture Notes in Computer Science;R. Alur,2008

2. Lecture Notes in Computer Science;R. Bloem,2009

3. Boros, E., Gurvich, V.: Why chess and back gammon can be solved in pure positional uniformly optimal strategies. Rutcor Research Report 21-2009, Rutgers University (2009)

4. Lecture Notes in Computer Science;P. Bouyer,2010

5. Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Nash equilibria in concurrent games with Büchi objectives. In: FSTTCS. LIPIcs, vol. 13, pp. 375–386. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Game-Theoretic Approach for the Synthesis of Complex Systems;Revolutions and Revelations in Computability;2022

2. On Relevant Equilibria in Reachability Games;Lecture Notes in Computer Science;2019

3. Computer Aided Synthesis: A Game-Theoretic Approach;Developments in Language Theory;2017

4. Efficient Energy Distribution in a Smart Grid using Multi-Player Games;Electronic Proceedings in Theoretical Computer Science;2016-07-31

5. Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games;Acta Informatica;2016-07-12