Pages that link to "Item:Q5473013"

The following pages link to Random Matching Under Dichotomous Preferences (Q5473013):

Displaying 50 items.

• Power set extensions of dichotomous preferences (Q325026) (← links)
• Strategy-proof stochastic assignment (Q402069) (← links)
• Altruistically unbalanced kidney exchange (Q403725) (← links)
• Random aggregation without the Pareto principle (Q427548) (← links)
• Allocating chances of success in finite and infinite societies: the utilitarian criterion (Q451060) (← links)
• Assigning agents to a line (Q485809) (← links)
• Pareto optimal matchings in many-to-many markets with ties (Q506537) (← links)
• Fractional matching markets (Q516999) (← links)
• Endogenous formation of networks for local public goods (Q532754) (← links)
• Kidney exchange: an egalitarian mechanism (Q533096) (← links)
• Group strategyproofness in queueing models (Q536097) (← links)
• Popular mixed matchings (Q541674) (← links)
• Collectively rational voting rules for simple preferences (Q553521) (← links)
• Bargaining and efficiency in networks (Q665449) (← links)
• The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences (Q690970) (← links)
• Pairwise kidney exchange (Q813943) (← links)
• Truthful fair division without free disposal (Q826615) (← links)
• A solution to the random assignment problem on the full preference domain (Q860356) (← links)
• Random assignment: redefining the serial rule (Q896952) (← links)
• Random scheduling with deadlines under dichotomous preferences (Q898667) (← links)
• Random assignment under weak preferences (Q1021614) (← links)
• On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
• The decomposition of strategy-proof random social choice functions on dichotomous domains (Q1680094) (← links)
• Price competition between random and assortive matchmakers (Q1680099) (← links)
• Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object (Q1680102) (← links)
• Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems (Q1680106) (← links)
• Assigning papers to referees (Q1959732) (← links)
• Size versus truncation robustness in the assignment problem (Q1985723) (← links)
• Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity (Q1995288) (← links)
• Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
• Strategy-proof exchange under trichotomous preferences (Q2025006) (← links)
• Kidney exchange with immunosuppressants (Q2059051) (← links)
• Stable matchings in the marriage model with indifferences (Q2059169) (← links)
• Group strategy-proof probabilistic voting with single-peaked preferences (Q2092786) (← links)
• Approval voting under dichotomous preferences: a catalogue of characterizations (Q2095260) (← links)
• Structured preferences: a literature survey (Q2096158) (← links)
• Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
• Ordinal approximation for social choice, matching, and facility location problems given candidate positions (Q2190377) (← links)
• Fair-by-design matching (Q2212506) (← links)
• Subjective homophily and the fixtures problem (Q2221249) (← links)
• The price of fairness for indivisible goods (Q2230722) (← links)
• Stable fractional matchings (Q2238635) (← links)
• Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
• Minimal envy and popular matchings (Q2242327) (← links)
• Fair and group strategy-proof good allocation with money (Q2247952) (← links)
• Egalitarian equivalence and strategyproofness in the queueing problem (Q2249580) (← links)
• The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
• Strategy-proof group selection under single-peaked preferences over group size (Q2294116) (← links)
• Size versus truthfulness in the house allocation problem (Q2319628) (← links)
• Submodular optimization views on the random assignment problem (Q2330658) (← links)