Approximate Strong Equilibrium in Job Scheduling Games

DOI10.1007/978-3-540-79309-0_7zbMath1136.91334arXiv1401.3494OpenAlexW1676535044MaRDI QIDQ5459972

Michal Feldman, Tami Tamir

Publication date: 2 May 2008

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

Full work available at URL: https://arxiv.org/abs/1401.3494

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ On the stability analysis of switched nonlinear systems with time varying delay under arbitrary switching ⋮ Multitask \(n\)-vehicle exploration problem: complexity and algorithm ⋮ Selfish bin covering ⋮ Approximate Strong Equilibrium in Job Scheduling Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong equilibrium in cost sharing connection games
• Coalition-proof Nash equilibria. I: Concepts
• Strong equilibrium in congestion games
• Network structure and strong equilibrium in route selection games.
• Crowding games are sequentially solvable
• 5th conference on optimization techniques. Part II
• On a network creation game
• A linear time approximation algorithm for multiprocessor scheduling
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Near-optimal network design with selfish agents
• On nash equilibria for a network creation game
• Algorithms, games, and the internet
• Network formation games with local coalitions
• Strong Price of Anarchy for Machine Load Balancing
• Approximate Strong Equilibrium in Job Scheduling Games
• Automata, Languages and Programming
• Algorithms – ESA 2005
• Bounds on Multiprocessing Timing Anomalies
• Approximation and Online Algorithms

This page was built for publication: Approximate Strong Equilibrium in Job Scheduling Games