Computation and efficiency of potential function minimizers of combinatorial congestion games
From MaRDI portal
Recommendations
- Totally unimodular congestion games
- On the impact of combinatorial structure on congestion games
- Efficient computation of approximate pure Nash equilibria in congestion games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3628712 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
- A class of games possessing pure-strategy Nash equilibria
- A geometric approach to the price of anarchy in nonatomic congestion games
- A matroid approach to finding edge connectivity and packing arborescences
- A new model for selfish routing
- Algorithmic Game Theory
- An application of simultaneous diophantine approximation in combinatorial optimization
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Congestion games viewed from M-convexity
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Convergence and approximation in potential games
- Convergence time to Nash equilibrium in load balancing
- Convergence to approximate Nash equilibria in congestion games
- Convex separable optimization is not much harder than linear optimization
- Edge-directions of standard polyhedra with applications to network flows
- Exact price of anarchy for polynomial congestion games
- Geometric algorithms and combinatorial optimization
- Integral decomposition in polyhedra
- Intrinsic robustness of the price of anarchy
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Nash equilibria in discrete routing games with convex latency functions
- On the impact of combinatorial structure on congestion games
- On the intersection of infinite matroids
- Potential games
- Price of stability in polynomial congestion games
- Selfish Routing in Capacitated Networks
- Solving integer minimum cost flows with separable convex cost objective polynomially
- The Price of Stability for Network Design with Fair Cost Allocation
- The asymptotic price of anarchy for \(k\)-uniform congestion games
- The complexity of pure Nash equilibria
- The price of anarchy in large games
- The price of anarchy is independent of the network topology
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- Tight bounds for selfish and greedy load balancing
- Totally unimodular congestion games
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Worst-case equilibria
Cited in
(4)
This page was built for publication: Computation and efficiency of potential function minimizers of combinatorial congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235157)
