The price of fairness for a two-agent scheduling game minimizing total completion time

DOI10.1007/S10878-020-00581-5zbMath1502.90080OpenAlexW3025715288MaRDI QIDQ2082220

Yubai Zhang, Zhaohui Liu, Zhao Zhang

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00581-5

zbMATH Keywords

scheduling problemprice of fairnessKS-fair

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• The efficiency of fair division
• The equal-loss principle for bargaining problems
• Fairness in simple bargaining experiments
• Price of fairness in two-agent single-machine scheduling problems
• Price of fairness for allocating a bounded resource
• Scheduling two agent task chains with a central selection mechanism
• A multiple-criterion model for machine scheduling
• The Price of Fairness for a Small Number of Indivisible Items
• The Price of Fairness
• Scheduling Problems with Two Competing Agents
• Other Solutions to Nash's Bargaining Problem
• Multiagent Scheduling
• Auction protocols for decentralized scheduling

This page was built for publication: The price of fairness for a two-agent scheduling game minimizing total completion time