Arbeitspapier
Core and Bargaining Set of Shortest Path Games
In this paper it is shown that the core and the bargaining sets of Davis-Maschler and Zhou coincide in a class of shortest path games.
- Sprache
-
Englisch
- Erschienen in
-
Series: Working Paper ; No. 2001:3
- Klassifikation
-
Wirtschaft
Game Theory and Bargaining Theory: General
- Thema
-
Shortest path games
core
bargaining set
Core
Spieltheorie
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Grahn, Sofia
- Ereignis
-
Veröffentlichung
- (wer)
-
Uppsala University, Department of Economics
- (wo)
-
Uppsala
- (wann)
-
2001
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:44 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Grahn, Sofia
- Uppsala University, Department of Economics
Entstanden
- 2001
Ähnliche Objekte (12)
Distributed shortest-path computation
Shortest path network problems
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Hierarchical speed-up techniques for shortest-path algorithms
Near-shortest path routing in hybrid communication networks
Distributed shortest-path computation
Shortest path network problems
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Hierarchical speed-up techniques for shortest-path algorithms
Near-shortest path routing in hybrid communication networks
Distributed shortest-path computation
Shortest path network problems
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Hierarchical speed-up techniques for shortest-path algorithms