Monografie
Efficient Computation of Equilibria in Bottleneck Games via Game Transformation
- Sprache
-
Deutsch
- Identifier
-
102738997X
- Reihe
-
Report in Wirtschaftsmathematik (WIMA Report); 134
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:53 MEZ
Objekttyp
- Monografie
Beteiligte
- Werth, Thomas L.
- Sperber, Heike
- Krumke, Sven O.
Ähnliche Objekte (12)
Selfish Bin Coloring
How to find Nash equilibria with extreme total latency in network congestion games?
Earliest Arrival Flows in Series-Parallel Graphs
Dynamic Multi-Period Routing With Two Classes
The Generalized Assignment Problem with Minimum Quantities
Train Marshalling Problem - Algorithms and Bounds
Generalized Max Flow in Series-Parallel Graphs
Online Delay Management
On Algorithmic Certification of Graph Structures
Fastest Paths, Almost Disjoint Paths, and Beyond
On the complexity and approximability of optimization problems with Minimum Quantity Constraints
A Parametric View on Robust Graph Problems
Selfish Bin Coloring
How to find Nash equilibria with extreme total latency in network congestion games?
Earliest Arrival Flows in Series-Parallel Graphs
Dynamic Multi-Period Routing With Two Classes
The Generalized Assignment Problem with Minimum Quantities
Train Marshalling Problem - Algorithms and Bounds
Generalized Max Flow in Series-Parallel Graphs
Online Delay Management
On Algorithmic Certification of Graph Structures
Fastest Paths, Almost Disjoint Paths, and Beyond
On the complexity and approximability of optimization problems with Minimum Quantity Constraints
A Parametric View on Robust Graph Problems
Selfish Bin Coloring
How to find Nash equilibria with extreme total latency in network congestion games?
Earliest Arrival Flows in Series-Parallel Graphs
Dynamic Multi-Period Routing With Two Classes
The Generalized Assignment Problem with Minimum Quantities
Train Marshalling Problem - Algorithms and Bounds
Generalized Max Flow in Series-Parallel Graphs
Online Delay Management
On Algorithmic Certification of Graph Structures
Fastest Paths, Almost Disjoint Paths, and Beyond
On the complexity and approximability of optimization problems with Minimum Quantity Constraints