Pages that link to "Item:Q1697833"

The following pages link to Impossibilities for probabilistic assignment (Q1697833):

Displaying 19 items.

• An impossibility theorem for allocation aggregation (Q484202) (← links)
• Evaluating assignment without transfers: a market perspective (Q529775) (← links)
• Consistency in the probabilistic assignment model (Q705901) (← links)
• Impossibility results for choice correspondences (Q1277456) (← links)
• Fair solutions to the random assignment problem (Q1633672) (← links)
• Probabilistic assignment: an extension approach (Q1649093) (← links)
• Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object (Q1680102) (← links)
• Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
• Probabilistic assignments of identical indivisible objects and uniform probabilistic rules (Q1880359) (← links)
• Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
• Group strategy-proof probabilistic voting with single-peaked preferences (Q2092786) (← links)
• When are efficient and fair assignment mechanisms group strategy-proof? (Q2291174) (← links)
• Notions of anonymity for object assignment: impossibility theorems (Q2299463) (← links)
• Multi resource allocation with partial preferences (Q2680798) (← links)
• (Q5797034) (← links)
• An étude in modeling the definability of equilibrium (Q6156318) (← links)
• On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
• Strategy-proof and envy-free random assignment (Q6163283) (← links)
• A new impossibility result for random assignments (Q6170029) (← links)