On slots' scheduling
From MaRDI portal
Publication:6559099
DOI10.1007/S00199-023-01508-XzbMATH Open1544.90092MaRDI QIDQ6559099FDOQ6559099
Authors: Anna Bogomolnaia 
Publication date: 21 June 2024
Published in: Economic Theory (Search for Journal in Brave)
Recommendations
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Serial Cost Sharing
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Fair Queuing and Other Probabilistic Allocation Methods
- A new solution to the random assignment problem.
- A solution to the random assignment problem on the full preference domain
- Minimizing the Worst Slowdown: Offline, Online
- Mechanism design in queueing problems
- Fairness and efficiency in strategy-proof object allocation mechanisms
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- A simple random assignment problem with a unique solution
- Probabilistic assignment of objects: characterizing the serial rule
- Ordinal efficiency and dominated sets of assignments.
- Two axiomatic approaches to the probabilistic serial mechanism
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Assigning agents to a line
- Allocation of divisible goods under lexicographic preferences
- Random assignment: redefining the serial rule
- Efficient allocation of heterogeneous commodities with balanced transfers
- Prior-free online mechanisms for queueing with arrivals
This page was built for publication: On slots' scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559099)
