Scheduling games with rank-based utilities

DOI10.1016/J.GEB.2023.03.007MaRDI QIDQ6160122zbMATH OpenOpenAlexFDO

Authors Shaul Rosner, Tami Tamir

Publication date 23 June 2023

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.geb.2023.03.007

zbMATH Keywords

competitionequilibrium inefficiencyscheduling gamesnashifying

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Potential and congestion games (91A14)

Recommendations

• Race scheduling games
• Cost-sharing games with rank-based utilities
• The price of anarchy for utilitarian scheduling games on related machines

Cites work

• A Theory of Fairness, Competition, and Cooperation
• A class of games possessing pure-strategy Nash equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Algorithms, games, and the internet
• Bin packing with divisible item sizes
• Bounds for Certain Multiprocessing Anomalies
• Bounds for List Schedules on Uniform Processors
• Bounds on Multiprocessing Timing Anomalies
• Closing the gap for makespan scheduling via sparsification techniques
• Conflicting congestion effects in resource allocation games
• Cost-sharing games with rank-based utilities
• Cost-sharing scheduling games on restricted unrelated machines
• Efficiency and fairness of system-optimal routing with user constraints
• Efficiency of equilibria in uniform matroid congestion games
• Games of status and discriminatory contracts
• Grading exams: 100,99,98,\(\dots \) or \(A,B,C\)?
• Inefficiency of games with social context
• Optimal coordination mechanisms for unrelated machine scheduling
• Potential games
• Ranking games
• Ranking games that have competitiveness-based strategies
• Scheduling
• Social context congestion games
• Strong Price of Anarchy for Machine Load Balancing
• Strong price of anarchy
• The Price of Stability for Network Design with Fair Cost Allocation
• The structure and complexity of Nash equilibria for a selfish routing game
• Tight bounds for selfish and greedy load balancing
• Tight bounds for worst-case equilibria
• Worst-case equilibria

Cited in

(4)

• Race scheduling games
• Cost-sharing games with rank-based utilities
• Ranking games that have competitiveness-based strategies
• Classifications, advances and prospects of scheduling games

This page was built for publication: Scheduling games with rank-based utilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160122)