Download presentation

Presentation is loading. Please wait.

Published byBaby Mitchiner Modified over 3 years ago

1
Adaptively Learning Tolls to Induce Target Flows Aaron Roth Joint work with Jon Ullman and Steven Wu

2
Non-Atomic Congestion Games A graph representing a road network

3
Non-Atomic Congestion Games

4
Equilibrium Flows

5
Routing games are potential games

6
Manipulating equilibrium flow (classic problem)

7
A Natural Problem [Bhaskar, Ligett, Schulman, Swamy FOCS 14]

8
The [BLSS] solution in a nutshell

9
Very neat! (Read the paper!) A couple of limitations: Latency functions must have a simple, known form: only unknowns are a small number of coefficients. Latency functions must be convex Heavy machinery Have to run Ellipsoid. Computationally intensive. Centralized.

10
Some desiderata Remove assumptions on latency functions No known parametric form Not necessarily convex Not necessarily Lipschitz Make update elementary Ideally decentralized.

11
Proposed algorithm: Tatonnemont.

12
Reverse engineering why it should work View the interaction as repeated play of a game between a toll player and a flow player. What game are they playing? Flow player’s strategies are feasible flows, toll player’s strategies are tolls in some bounded range What are their cost functions? How are they playing it?

13
Behavior of the flow player is clear.

14
Behavior of the toll player?

15
So algorithm is consistent with:

16
Questions Does the equilibrium of this game correspond to the target flow? Does this repeated play converge (quickly) to equilibrium?

17
Questions

18
Does this repeated play converge (quickly) to equilibrium? It does in zero sum games! [FreundSchapire96?] Actual strategy of GD player, empirical average of BR player.

19
So it converges in a zero sum game.

20
Strategic Equivalence Adding a strategy-independent term to a player’s cost function does not change that player’s best response function And so doesn’t change the equilibria of the game…

21
So it converges in a zero sum game.

24
So the dynamics converge!

25
Do approximate min-max tolls guarantee the approximate target flow?

26
Upshot

27
Questions Exact convergence without assumptions on latency functions? Extensions to other games? Seem to crucially use the fact that equilibrium is the solution to a convex optimization problem…

28
Questions Exact convergence without assumptions on latency functions? Extensions to other games? Seem to crucially use the fact that equilibrium is the solution to a convex optimization problem…

Similar presentations

OK

Capacity Allocation in Networks Under Noncooperative Elastic Users Instructor: Ishai Menache Eliron Amir Winter 2006.

Capacity Allocation in Networks Under Noncooperative Elastic Users Instructor: Ishai Menache Eliron Amir Winter 2006.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Download ppt on indus valley civilization timeline Ppt on tamper resistant bolts Ppt on project life cycle Ppt on gujarati culture association Ppt on non ferrous metals and alloys Ppt on internet services download Ppt on credit default swaps 2016 Ppt on question tags sentence Flexible display ppt online Ppt on current affairs 2014