Price of fairness in two-agent single-machine scheduling problems
From MaRDI portal
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
- 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
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- 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 aircraft landings using airlines' preferences
- Scheduling Problems with Two Competing Agents
- The bargaining problem
- The efficiency of fair division
- The equal-loss principle for bargaining problems
- The price of fairness
Cited in
(24)- 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
- Pareto-scheduling of two competing agents with their own equal processing times
- Decentralized task coordination
- 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
- Efficiency and equity in the multi organization scheduling problem
- Scheduling with competing agents, total late work and job rejection
- Kalai-Smorodinsky price of fairness in two-agent single-machine scheduling problem to minimize the number of tardy jobs and maximum cost function
- A note on fairness measure for scheduling problems over unrelated machines
- 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
- Fair algorithm design: fair and efficacious machine scheduling
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation
- On the price of fairness of allocating contiguous blocks
- Fifty years of research in scheduling -- theory and applications
- Trade-off between utility and fairness in two-agent single-machine scheduling
- Fairness in repetitive scheduling
- Analyzing the price of fairness in scheduling problems with two agents
- Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines
- A scheduling game on parallel batch machines with setup cost
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)
