Pages that link to "Item:Q1995295"

The following pages link to Partial strategyproofness: relaxing strategyproofness for the random assignment problem (Q1995295):

Displaying 23 items.

• Convex strategyproofness with an application to the probabilistic serial mechanism (Q284366) (← links)
• Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
• Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
• Ex-post favoring ranks: a fairness notion for the random assignment problem (Q2059097) (← links)
• Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
• Strategic schools under the Boston mechanism revisited (Q2628708) (← links)
• Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
• (Q5111230) (← links)
• Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
• The object allocation problem with favoring upper ranks (Q6053622) (← links)
• Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
• Inefficiency of random serial dictatorship under incomplete information (Q6090465) (← links)
• Random assignments with uniform preferences: an impossibility result (Q6106541) (← links)
• Ordinal Bayesian incentive compatibility in random assignment model (Q6156325) (← 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)
• Some characterizations of generalized top trading cycles (Q6176732) (← links)
• A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)
• Stochastic same-sidedness in the random voting model (Q6541015) (← links)
• Modifications of Boston, Taiwanese and Chinese mechanisms are not comparable via counting manipulating students (Q6549826) (← links)
• Robustness to manipulations in school choice (Q6570723) (← links)
• Some further results on random OBIC rules (Q6637012) (← links)