Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games

DOI10.1007/978-3-642-16170-4_7zbMath1310.91035OpenAlexW3137530339MaRDI QIDQ3162508

Yonatan Aumann, Yair Dombb

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16170-4_7

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (10)

Selfish Vector Packing ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ Selfish vector packing ⋮ Dividing connected chores fairly ⋮ The efficiency of fair division ⋮ Magnitude of inefficiency ⋮ Dividing splittable goods evenly and with limited fragmentation

Cites Work

• Unnamed Item
• Unnamed Item
• \(\epsilon\)-solutions in vector minimization problems
• The Bargaining Problem
• The Price of Stability for Network Design with Fair Cost Allocation
• Approximating the Pareto Front of Multi-criteria Optimization Problems
• Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
• Inefficiency of Nash Equilibria
• Construction of Outcome Functions Guaranteeing Existence and Pareto Optimality of Nash Equilibria
• Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games
• Nash Equilibrium and Welfare Optimality
• Algorithmic Game Theory
• Approximate Strong Equilibrium in Job Scheduling Games
• The price of anarchy is independent of the network topology

This page was built for publication: Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games