On popular random assignments
From MaRDI portal
Publication:2856142
DOI10.1007/978-3-642-41392-6_16zbMATH Open1319.91099OpenAlexW58217663MaRDI QIDQ2856142FDOQ2856142
Authors: Haris Aziz, Felix Brandt, Paul Stursberg
Publication date: 23 October 2013
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-41392-6_16
Recommendations
Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)
Cited In (8)
- Minimal envy and popular matchings
- Finding and Recognizing Popular Coalition Structures
- Fair assignment of indivisible objects under ordinal preferences
- Popularity, Mixed Matchings, and Self-Duality
- Welfare maximization entices participation
- Fairness in Influence Maximization through Randomization
- Impossibilities for probabilistic assignment
- Strategy-proof popular mechanisms
This page was built for publication: On popular random assignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856142)