Pages that link to "Item:Q1411037"

The following pages link to Ordinal efficiency and dominated sets of assignments. (Q1411037):

Displaying 36 items.

• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853) (← links)
• Assigning agents to a line (Q485809) (← links)
• Popular mixed matchings (Q541674) (← links)
• Efficiency under a combination of ordinal and cardinal information on preferences (Q553528) (← links)
• An efficiency theorem for incompletely known preferences (Q617691) (← links)
• Consistency in the probabilistic assignment model (Q705901) (← links)
• Universal Pareto dominance and welfare for plausible utility functions (Q745015) (← links)
• Pairwise kidney exchange (Q813943) (← links)
• Why do popular mechanisms lack efficiency in random environments? (Q840694) (← links)
• Incentives in the probabilistic serial mechanism (Q848608) (← links)
• A solution to the random assignment problem on the full preference domain (Q860356) (← links)
• A constructive proof of the ordinal efficiency welfare theorem (Q938066) (← links)
• The probabilistic serial mechanism with private endowments (Q980972) (← links)
• Random assignment of multiple indivisible objects (Q1005770) (← links)
• Random assignment under weak preferences (Q1021614) (← 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)
• Computational aspects of assigning agents to a line (Q1680103) (← links)
• Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
• Random assignments on sequentially dichotomous domains (Q2173423) (← links)
• On endowments and indivisibility: partial ownership in the Shapley-Scarf model (Q2205990) (← links)
• Short trading cycles: paired kidney exchange with strict ordinal preferences (Q2306268) (← links)
• On the terminology of economic design: a critical assessment and some proposals (Q2318132) (← links)
• Shortest paths with ordinal weights (Q2327649) (← links)
• Efficient rules for probabilistic assignment (Q2338661) (← links)
• Random assignments on preference domains with a tier structure (Q2338670) (← 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)
• Random serial dictatorship and ordinally efficient contracts (Q2482677) (← links)
• Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
• Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← links)
• A new solution to the random assignment problem. (Q5958895) (← links)
• On wastefulness of random assignments in discrete allocation problems (Q6113818) (← links)
• Simultaneous eating algorithm and greedy algorithm in assignment problems (Q6176397) (← links)
• On slots' scheduling (Q6559099) (← links)