Iterated Regret Minimization in Game Graphs-Reference-Cited by-同舟云学术

Iterated Regret Minimization in Game Graphs

Published:2010 Issue: Volume: Page:342-354
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2010
language:
Short-container-title:

Author:

Filiot Emmanuel,Le Gall Tristan,Raskin Jean-François

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15155-2_31

Reference9 articles.

1. Brihaye, T., Bruyère, V., De Pril, J.: Equilibria in quantitative reachability games. In: International Computer Science Symposium in Russia (2010)

2. Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Games with secure equilibria. In: LICS, pp. 160–169 (2004)

3. Lecture Notes in Computer Science;D. Fisman,2010

4. Lecture Notes in Computer Science,2002

5. Grädel, E., Ummels, M.: Solution concepts and algorithms for infinite multiplayer games. In: New Perspectives on Games and Interaction. Texts In Logic and Games, vol. 4, pp. 151–178 (2008)

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

1. Efficient Symbolic Approaches for Quantitative Reactive Synthesis with Finite Tasks;2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2023-10-01

2. To Explore or Not to Explore: Regret-Based LTL Planning in Partially-Known Environments;IFAC-PapersOnLine;2023

3. Let's Collaborate: Regret-based Reactive Synthesis for Robotic Manipulation;2022 International Conference on Robotics and Automation (ICRA);2022-05-23

4. The Impatient May Use Limited Optimism to Minimize Regret;Lecture Notes in Computer Science;2019

5. Reactive synthesis without regret;Acta Informatica;2016-04-27