Pages that link to "Item:Q5958895"

The following pages link to A new solution to the random assignment problem. (Q5958895):

Displaying 50 items.

• A pessimist's approach to one-sided matching (Q2103007) (← links)
• Trading probabilities along cycles (Q2138374) (← links)
• Constrained random matching (Q2155237) (← links)
• Matching and scheduling of student-company-talks for a university it-speed dating event (Q2167666) (← links)
• Information acquisition and provision in school choice: a theoretical investigation (Q2168548) (← links)
• Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
• Random assignments on sequentially dichotomous domains (Q2173423) (← links)
• Continuity and incentive compatibility in cardinal mechanisms (Q2178581) (← links)
• Local vs. global strategy-proofness: a new equivalence result for ordinal mechanisms (Q2179761) (← links)
• On endowments and indivisibility: partial ownership in the Shapley-Scarf model (Q2205990) (← links)
• Fair-by-design matching (Q2212506) (← links)
• Welfare theorems for random assignments with priorities (Q2212739) (← links)
• Ex-post incentive compatible and individually rational assignments in housing markets with interdependent values (Q2222222) (← links)
• Foundations of pseudomarkets: Walrasian equilibria for discrete resources (Q2231384) (← links)
• Information acquisition and provision in school choice: an experimental study (Q2231425) (← links)
• Peeking behind the ordinal curtain: improving distortion via cardinal queries (Q2238590) (← links)
• Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
• Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
• Corrigendum to ``Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems'' (Q2278941) (← links)
• Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity (Q2289006) (← links)
• The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
• When are efficient and fair assignment mechanisms group strategy-proof? (Q2291174) (← links)
• Notions of anonymity for object assignment: impossibility theorems (Q2299463) (← links)
• Short trading cycles: paired kidney exchange with strict ordinal preferences (Q2306268) (← links)
• Ex-ante efficiency in assignments with seniority rights (Q2318115) (← links)
• On the terminology of economic design: a critical assessment and some proposals (Q2318132) (← links)
• Size versus truthfulness in the house allocation problem (Q2319628) (← 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)
• Fairness and efficiency in strategy-proof object allocation mechanisms (Q2359384) (← links)
• Efficient lottery design (Q2362194) (← links)
• A graph theoretic approach to the slot allocation problem (Q2362198) (← links)
• Strategy-proof assignment on the full preference domain (Q2386134) (← links)
• House allocation with existing tenants: an equivalence (Q2387316) (← links)
• Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem (Q2411514) (← links)
• A task-allocation problem (Q2425161) (← links)
• A two-objective fuzzy \(k\)-cardinality assignment problem (Q2432725) (← links)
• Reclaim-proof allocation of indivisible objects (Q2436293) (← links)
• Efficient resource allocation under multi-unit demand (Q2437801) (← links)
• A note on object allocation under lexicographic preferences (Q2441234) (← links)
• Matching mechanisms and matching quality: evidence from a top university in China (Q2442836) (← links)
• A general equivalence theorem for allocation of indivisible objects (Q2444698) (← links)
• The ``Boston'' school-choice mechanism: an axiomatic approach (Q2447152) (← links)
• Markovian assignment rules (Q2452135) (← links)
• The computational complexity of random serial dictatorship (Q2453028) (← links)
• Probabilistic assignment of indivisible goods with single-peaked preferences (Q2453443) (← links)
• The extended serial correspondence on a rich preference domain (Q2453497) (← links)
• The worst absolute surplus loss in the problem of commons: random priority versus average cost (Q2460223) (← links)