scientific article; zbMATH DE number 6744943
From MaRDI portal
Publication:5275395
DOI10.4230/LIPIcs.FSTTCS.2015.543zbMath1369.91109arXiv1206.4366MaRDI QIDQ5275395
Vijay V. Vazirani, Leonard J. Schulman
Publication date: 13 July 2017
Full work available at URL: https://arxiv.org/abs/1206.4366
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (9)
Equivalence of efficiency notions for ordinal assignment problems ⋮ Random assignment: redefining the serial rule ⋮ A note on object allocation under lexicographic preferences ⋮ When is the probabilistic serial assignment uniquely efficient and envy-free? ⋮ Extended random assignment mechanisms on a family of good sets ⋮ A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences ⋮ Incentive properties for ordinal mechanisms ⋮ The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching ⋮ Submodular optimization views on the random assignment problem
This page was built for publication:
