On slots' scheduling
From MaRDI portal
Publication:6559099
Recommendations
Cites work
- A new solution to the random assignment problem.
- A simple random assignment problem with a unique solution
- A solution to the random assignment problem on the full preference domain
- Allocation of divisible goods under lexicographic preferences
- Assigning agents to a line
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Efficient allocation of heterogeneous commodities with balanced transfers
- Fair Queuing and Other Probabilistic Allocation Methods
- Fairness and efficiency in strategy-proof object allocation mechanisms
- Mechanism design in queueing problems
- Minimizing the Worst Slowdown: Offline, Online
- Ordinal efficiency and dominated sets of assignments.
- Prior-free online mechanisms for queueing with arrivals
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Probabilistic assignment of objects: characterizing the serial rule
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Random assignment: redefining the serial rule
- Serial Cost Sharing
- Two axiomatic approaches to the probabilistic serial mechanism
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)