Price of fairness in two-agent single-machine scheduling problems

DOI10.1016/J.EJOR.2018.12.048MaRDI QIDQ1728475zbMATH OpenOpenAlexWikidataFDO

Authors Alessandro Agnetis, Bo Chen, Gaia Nicosia, 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

zbMATH Keywords

max-min fairnesstwo-agent schedulingprice of fairnessproportional fairnessKalai-Smorodinsky fairness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Kalai-Smorodinsky price of fairness in two-agent single-machine scheduling problem to minimize the number of tardy jobs and maximum cost function
• The price of fairness for a two-agent scheduling game minimizing total completion time
• The price of fairness
• Multi-agent single machine scheduling
• Price of fairness for allocating a bounded resource

Cites work

• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• A Theory of Fairness, Competition, and Cooperation
• Auction protocols for decentralized scheduling
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
• Computing the Nash solution for scheduling bargaining problems
• Fairness in simple bargaining experiments
• Inequity averse optimization in operational research
• Multiagent scheduling. Models and algorithms
• Nash bargaining theory when the number of alternatives can be finite
• Other Solutions to Nash's Bargaining Problem
• Price of fairness for allocating a bounded resource
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Scheduling Problems with Two Competing Agents
• Scheduling aircraft landings using airlines' preferences
• The bargaining problem
• The efficiency of fair division
• The equal-loss principle for bargaining problems
• The price of fairness

Cited in

(17)

• 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
• 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
• Pareto-scheduling of two competing agents with their own equal processing times
• Rawlsian fairness in push and pull supply chains
• A note on fairness measure for scheduling problems over unrelated machines
• Efficiency and equity in the multi organization scheduling problem
• Computing welfare-maximizing fair allocations of indivisible goods
• Decentralized task coordination
• Kalai-Smorodinsky price of fairness in two-agent single-machine scheduling problem to minimize the number of tardy jobs and maximum cost function
• Optimally rescheduling jobs with a last-in-first-out buffer
• The price of fairness for a two-agent scheduling game minimizing total completion time
• A distributed primal-dual hybrid gradient algorithm for fair resource allocation
• 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
• Fair algorithm design: fair and efficacious machine scheduling

This page was built for publication: Price of fairness in two-agent single-machine scheduling problems

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