Pages that link to "Item:Q462853"
From MaRDI portal
The following pages link to Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853):
Displaying 19 items.
- A characterization of the extended serial correspondence (Q492874) (← links)
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Fair solutions to the random assignment problem (Q1633672) (← links)
- The object allocation problem with random priorities (Q1651226) (← links)
- On the consistency of random serial dictatorship (Q1670191) (← links)
- Impossibilities for probabilistic assignment (Q1697833) (← links)
- Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
- Constrained random matching (Q2155237) (← links)
- Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
- Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- Implementation in stochastic dominance Nash equilibria (Q2362193) (← links)
- A note on object allocation under lexicographic preferences (Q2441234) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- A Mathematical Model of Demand-Supply Dynamics with Collectability and Saturation Factors (Q2973275) (← links)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
- Axiomatic characterizations of the constrained probabilistic serial mechanism (Q6054914) (← links)
- Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
- A simple characterization of assignment mechanisms on set constraints (Q6155636) (← links)