Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
Year of publication: |
2024
|
---|---|
Authors: | Boros, Endre ; Franciosa, Paolo Giulio ; Gurvich, Vladimir ; Vyalyi, Michael |
Published in: |
International journal of game theory. - Berlin : Springer, ISSN 1432-1270, ZDB-ID 1459207-1. - Vol. 53.2024, 2, p. 449-473
|
Subject: | n-Person deterministic graphical games | Nash equilibrium | Shortest path games | Terminal games | Spieltheorie | Game theory | Nash-Gleichgewicht |
-
Solutions in multi-actor projects with collaboration and strategic incentives
Beek, Andries van, (2023)
-
Mixed strategy nash equilibria in signaling games
Cobb, Barry R., (2013)
-
Second container port in Sri Lanka : Hambanthota or Trincomalee ; an analysis using the game theory
Rathnayake, Jayantha, (2012)
- More ...
-
Computing remoteness functions of Moore, Wythoff, and Euclid's games
Boros, Endre, (2024)
-
Boros, Endre, (2013)
-
Stable effectivity functions and perfect graphs
Boros, Endre, (2000)
- More ...