Pages that link to "Item:Q2277345"

The following pages link to On a conjecture by Gale about one-sided matching problems (Q2277345):

Displaying 39 items.

• Size versus truthfulness in the house allocation problem (Q2319628) (← links)
• Envy-freeness in house allocation problems (Q2334840) (← links)
• Fairness and efficiency in strategy-proof object allocation mechanisms (Q2359384) (← links)
• Efficient lottery design (Q2362194) (← links)
• House allocation with existing tenants: an equivalence (Q2387316) (← links)
• Matching with quorums (Q2440142) (← links)
• Matching mechanisms and matching quality: evidence from a top university in China (Q2442836) (← links)
• Serial dictatorship and Pareto optimality (Q2462289) (← links)
• Reducing rank-maximal to maximum weight matching (Q2465632) (← links)
• Characterizations of the optimal stable allocation mechanism (Q2467483) (← links)
• Welfare and stability in senior matching markets (Q2482669) (← links)
• On one-sided versus two-sided matching games (Q2564137) (← links)
• Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
• Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
• Multi resource allocation with partial preferences (Q2680798) (← links)
• Strategy-proof allocation with outside option (Q2681500) (← links)
• Profile-Based Optimal Matchings in the Student/Project Allocation Problem (Q2946056) (← links)
• Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← links)
• Bounded Unpopularity Matchings (Q3512453) (← links)
• On mechanisms eliciting ordinal preferences (Q4612470) (← links)
• (Q5111230) (← links)
• Weighted popular matchings (Q5501956) (← links)
• Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
• A new solution to the random assignment problem. (Q5958895) (← links)
• House allocation with transfers (Q5958896) (← links)
• Review of the theory of stable matchings and contract systems (Q6039790) (← links)
• The object allocation problem with favoring upper ranks (Q6053622) (← links)
• Optimal assignment mechanisms with imperfect verification (Q6076910) (← links)
• Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
• Inefficiency of random serial dictatorship under incomplete information (Q6090465) (← links)
• On wastefulness of random assignments in discrete allocation problems (Q6113818) (← links)
• Bounded incentives in manipulating the probabilistic serial rule (Q6142601) (← links)
• On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
• Strategy-proofness in linear production economies with homothetic or quasi-linear preferences (Q6164133) (← links)
• A new impossibility result for random assignments (Q6170029) (← links)
• Strategy-proofness in private good economies with linear preferences: an impossibility result (Q6188306) (← links)
• A Lattice Linear Predicate Parallel Algorithm for the Housing Market Problem (Q6488434) (← links)
• Game-theoretically secure protocols for the ordinal random assignment problem (Q6535137) (← links)
• The price of anarchy of probabilistic serial in one-sided allocation problems (Q6609163) (← links)