Optimal competitive ratio for optimization problems with congestion effects
From MaRDI portal
Cites work
- A class of games possessing pure-strategy Nash equilibria
- A new model for selfish routing
- A priority-based model of routing
- A survey of algorithms and analysis for adaptive online learning
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- Approximating generalized network design under (dis)economies of scale with applications to energy efficiency
- Barriers to near-optimal equilibria
- Competitive online multicommodity routing
- Competitive snoopy caching
- Convergence and approximation in potential games
- Coping with selfishness in congestion games. Analysis and design via LP duality
- Equilibrium points in n -person games
- How much can taxes help selfish routing?
- scientific article; zbMATH DE number 5764829 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- In congestion games, taxes achieve optimal approximation
- Mechanisms for (mis)allocating scientific credit
- Non-atomic one-round walks in congestion games
- On the impact of singleton strategies in congestion games
- On-line load balancing
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Online algorithms. The state of the art
- Online generalized network design under (dis)economies of scale
- Online learning and online convex optimization
- Performance of one-round walks in linear congestion games
- Selfish load balancing and atomic congestion games
- Solving Optimization Problems with Diseconomies of Scale via Decoupling
- Taxes for linear atomic congestion games
- The Competitiveness of On-Line Assignments
- The complexity of welfare maximization in congestion games
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- The online best reply algorithm for resource allocation problems
- Tight bounds for selfish and greedy load balancing
- Worst-case equilibria
This page was built for publication: Optimal competitive ratio for optimization problems with congestion effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346835)
