Advertisement
Published in:
2010 | OriginalPaper | Chapter
Nash Equilibria for Reachability Objectives in Multi-player Timed Games
Authors : Patricia Bouyer, Romain Brenguier, Nicolas Markey
Published in: CONCUR 2010 - Concurrency Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We propose a procedure for computing Nash equilibria in multi-player timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.