-
Pure Nash Equilibria in Resource Graph Games
This paper studies the existence of pure Nash equilibria in resource gra...
07/17/2020 ∙ by Tobias Harks, et al. ∙
0
∙
share
read it
-
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows
Instantaneous dynamic equilibrium (IDE) is a standard game-theoretic con...
07/15/2020 ∙ by Lukas Graf, et al. ∙
0
∙
share
read it
-
The Price of Anarchy for Instantaneous Dynamic Equilibria
We consider flows over time within the deterministic queueing model and ...
07/15/2020 ∙ by Lukas Graf, et al. ∙
0
∙
share
read it
-
Pricing in Resource Allocation Games Based on Duality Gaps
We consider a basic resource allocation game, where the players' strateg...
07/03/2019 ∙ by Tobias Harks, et al. ∙
0
∙
share
read it
-
Capacity and Price Competition in Markets with Congestion Effects
We study oligopolistic competition in service markets where firms offer ...
05/14/2019 ∙ by Tobias Harks, et al. ∙
0
∙
share
read it
-
Dynamic Flows with Adaptive Route Choice
We study dynamic network flows and introduce a notion of instantaneous d...
11/18/2018 ∙ by Lukas Graf, et al. ∙
0
∙
share
read it
-
Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs
In this paper, we compute ϵ-approximate Nash equilibria in atomic splitt...
08/13/2018 ∙ by Tobias Harks, et al. ∙
0
∙
share
read it
-
Toll Caps in Privatized Road Networks
We study a nonatomic routing game on a parallel link network in which li...
02/28/2018 ∙ by Tobias Harks, et al. ∙
0
∙
share
read it
-
Efficient Black-Box Reductions for Separable Cost Sharing
In cost sharing games with delays, a set of agents jointly allocates a f...
02/28/2018 ∙ by Tobias Harks, et al. ∙
0
∙
share
read it
