Magnitude of inefficiency
From MaRDI portal
Publication:2030487
Recommendations
Cites work
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- Braess-like paradoxes in distributed computer systems
- Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control
- Deterministic and stochastic wireless network games: equilibrium, dynamics, and price of anarchy
- Effects of symmetry on globalizing separated monopolies to a Nash-Cournot oligopoly
- Equilibrium strategies for multiple interdictors on a common network
- Inefficiency of Nash Equilibria
- Nash equilibrium based fairness
- Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems
- On the price of anarchy in a single-server queue with heterogeneous service valuations induced by travel costs
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Price of anarchy and price of stability in multi-agent project scheduling
- Price of anarchy in a linear-state stochastic dynamic game
- Rare Nash equilibria and the price of anarchy in large static games
- Stronger bounds on Braess's paradox and the maximum latency of selfish routing
- The price of anarchy in supply chains: quantifying the efficiency of price-only contracts
- The price of fairness
- Über ein Paradoxon aus der Verkehrsplanung
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Worst-case equilibria
Cited in
(4)
This page was built for publication: Magnitude of inefficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030487)
