Queue allocation of indivisible goods
From MaRDI portal
Publication:1338546
DOI10.1007/BF00183301zbMath0812.90034OpenAlexW1969400029MaRDI QIDQ1338546
Publication date: 15 May 1995
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00183301
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (39)
Overlapping multiple object assignments ⋮ Games of capacity allocation in many-to-one matching with an aftermarket ⋮ Pareto Optimal Matchings in Many-to-Many Markets with Ties ⋮ Transferring ownership of public housing to existing tenants: a market design approach ⋮ Strategy-proof assignment on the full preference domain ⋮ House allocation with existing tenants: an equivalence ⋮ Strategy-proof voting on the full preference domain ⋮ A solution to the random assignment problem on the full preference domain ⋮ Pareto optimal matchings of students to courses in the presence of prerequisites ⋮ A complete characterization of hierarchy ⋮ On stable and efficient mechanisms for priority-based allocation problems ⋮ Pareto optimal matchings with lower quotas ⋮ The vigilant eating rule: a general approach for probabilistic economic design with constraints ⋮ Top trading with fixed tie-breaking in markets with indivisible goods ⋮ Strategy-proof and envy-free mechanisms for house allocation ⋮ Stable and efficient resource allocation under weak priorities ⋮ Sequential rules for house allocation with price restrictions ⋮ Outside options in neutral allocation of discrete resources ⋮ A simple matching domain with indifferences and a master list ⋮ Impossibilities for probabilistic assignment ⋮ Games of capacity manipulation in hospital-intern markets ⋮ Reclaim-proof allocation of indivisible objects ⋮ Weakly fair allocations and strategy-proofness ⋮ The computational complexity of random serial dictatorship ⋮ Parametrized algorithms for random serial dictatorship ⋮ Pareto optimal matchings in many-to-many markets with ties ⋮ Pareto-optimal assignments by hierarchical exchange ⋮ A note on the assignment problem with uniform preferences ⋮ Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences ⋮ Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity ⋮ Counting houses of Pareto optimal matchings in the house allocation problem ⋮ Random assignment under weak preferences ⋮ Serial dictatorship mechanisms with reservation prices: heterogeneous objects ⋮ Size versus truthfulness in the house allocation problem ⋮ A tale of two mechanisms: Student placement ⋮ A new allocation rule for the housing market problem with ties ⋮ Strategy-proof popular mechanisms ⋮ Strategy-proofness and population-monotonicity for house allocation problems ⋮ Pairwise kidney exchange
This page was built for publication: Queue allocation of indivisible goods
