Pages that link to "Item:Q896952"

The following pages link to Random assignment: redefining the serial rule (Q896952):

Displaying 21 items.

• When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
• Probabilistic assignment: an extension approach (Q1649093) (← links)
• Equivalence of efficiency notions for ordinal assignment problems (Q1668490) (← links)
• Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object (Q1680102) (← links)
• A marriage matching mechanism menagerie (Q1727951) (← links)
• Constrained random matching (Q2155237) (← links)
• Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
• Submodular optimization views on the random assignment problem (Q2330658) (← links)
• Efficient rules for probabilistic assignment (Q2338661) (← links)
• Random assignments on preference domains with a tier structure (Q2338670) (← links)
• Size versus fairness in the assignment problem (Q2343388) (← links)
• Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem (Q2411514) (← links)
• A note on object allocation under lexicographic preferences (Q2441234) (← links)
• The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
• Incentive properties for ordinal mechanisms (Q5964696) (← links)
• A simple characterization of assignment mechanisms on set constraints (Q6155636) (← links)
• Strategy-proof and envy-free random assignment (Q6163283) (← links)
• The fractional Boston random assignment rule and its axiomatic characterization (Q6541989) (← links)
• On slots' scheduling (Q6559099) (← links)
• Corrigendum to: ``Random assignment: redefining the serial rule'' (Q6564055) (← links)
• Characterizing a probabilistic version of the Boston mechanism under weak priorities (Q6665050) (← links)