4 problems
- 0 votes0 replies0 views
Unique limit equilibrium in each connected component of routing-game equilibria
Unique-limit-equilibrium conjecture. Every connected component of equilibria in contains one and only one limit equilibrium.
- 0 votes0 replies0 views
Oh, Harks, and Condorelli–Watson's breakpoint derivative conjecture for routing games
Let be a routing game whose cost functions are continuous, differentiable, strictly increasing, and have positive seco…
- 0 votes0 replies1 view
Uniqueness of limit equilibria in connected equilibrium components
Uniqueness conjecture. Every connected component of equilibria admits one and only one limit equilibrium of the logit dynamics.
- 0 votes0 replies0 views
Non-local toll updates for bilevel message-passing algorithms in atomic routing games
In atomic routing games, let denote the toll-dependent equilibrium flow on edge , and let denote the flow minimizing the social cost during the upper-level…