A graph theoretic approach to the slot allocation problem
From MaRDI portal
Publication:2362198
DOI10.1007/s00355-016-0975-yzbMath1392.91104OpenAlexW2438505903MaRDI QIDQ2362198
Publication date: 6 July 2017
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://ier.snu.ac.kr/activity/working-papers?md=download&seqidx=33
Applications of graph theory (05C90) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (3)
Computational aspects of assigning agents to a line ⋮ A characterization of the Vickrey rule in slot allocation problems ⋮ Recent developments in the queueing problem
Cites Work
- Probabilistic assignment of objects: characterizing the serial rule
- Assigning agents to a line
- A solution to the random assignment problem on the full preference domain
- Random assignment under weak preferences
- Incentives in landing slot problems
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
- Random Matching Under Dichotomous Preferences
- The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
- A new solution to the random assignment problem.
This page was built for publication: A graph theoretic approach to the slot allocation problem
