Price of fairness in two-agent single-machine scheduling problems
From MaRDI portal
Publication:1728475
DOI10.1016/j.ejor.2018.12.048zbMath1430.90240OpenAlexW2910698331MaRDI QIDQ1728475
Gaia Nicosia, Bo Chen, Alessandro Agnetis, Andrea Pacifici
Publication date: 25 February 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/112370/7/WRAP-price-fairness-two-agent-single-machine-scheduling-problems-Chen-2018.pdf
two-agent schedulingmax-min fairnessprice of fairnessproportional fairnessKalai-Smorodinsky fairness
Related Items (13)
Pareto-scheduling of two competing agents with their own equal processing times ⋮ Decentralized task coordination ⋮ Efficiency and equity in the multi organization scheduling problem ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Rawlsian fairness in push and pull supply chains ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ The price of fairness for a two-agent scheduling game minimizing total completion time
Cites Work
- Unnamed Item
- Inequity averse optimization in operational research
- The efficiency of fair division
- Computing the Nash solution for scheduling bargaining problems
- The equal-loss principle for bargaining problems
- Fairness in simple bargaining experiments
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Price of fairness for allocating a bounded resource
- Nash bargaining theory when the number of alternatives can be finite
- Scheduling aircraft landings using airlines' preferences
- The Price of Fairness
- The Bargaining Problem
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Scheduling Problems with Two Competing Agents
- Other Solutions to Nash's Bargaining Problem
- A Theory of Fairness, Competition, and Cooperation
- Multiagent Scheduling
- Auction protocols for decentralized scheduling
This page was built for publication: Price of fairness in two-agent single-machine scheduling problems