Pages that link to "Item:Q5958895"

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

Displaying 50 items.

• The probabilistic serial mechanism with private endowments (Q980972) (← links)
• Random assignment of multiple indivisible objects (Q1005770) (← links)
• Random assignment under weak preferences (Q1021614) (← links)
• An experimental examination into the design of decentralized methods to solve the assignment problem with and without money (Q1341475) (← links)
• Ordinal efficiency and dominated sets of assignments. (Q1411037) (← links)
• The evolution of exchange. (Q1427490) (← links)
• The \textit{ex ante} incentive compatible core of the assignment game. (Q1431786) (← links)
• The generalized random priority mechanism with budgets (Q1622384) (← links)
• Fair solutions to the random assignment problem (Q1633672) (← links)
• Probabilistic assignment: an extension approach (Q1649093) (← links)
• On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
• The object allocation problem with random priorities (Q1651226) (← links)
• Matching in the large: an experimental study (Q1651242) (← links)
• The impossibility of extending random dictatorship to weak preferences (Q1668159) (← links)
• Weighted randomized dictatorship and the asymmetric Nash solution (Q1668232) (← links)
• Equivalence of efficiency notions for ordinal assignment problems (Q1668490) (← links)
• Fractional group identification (Q1669108) (← links)
• On the consistency of random serial dictatorship (Q1670191) (← links)
• On characterizations of the probabilistic serial mechanism involving incentive and invariance properties (Q1680097) (← 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)
• Impossibilities for probabilistic assignment (Q1697833) (← links)
• Fair student placement (Q1706794) (← links)
• A marriage matching mechanism menagerie (Q1727951) (← links)
• Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
• Handling preferences in student-project allocation (Q1730741) (← links)
• Designing mechanisms to focalize welfare-improving strategies (Q1735813) (← links)
• Matching with indifferences: a comparison of algorithms in the context of course allocation (Q1753433) (← links)
• A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism (Q1753688) (← links)
• A note on the assignment problem with uniform preferences (Q1785360) (← links)
• Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
• Strategy-proofness and population-monotonicity for house allocation problems (Q1867775) (← links)
• Strategic candidacy for multivalued voting procedures (Q1877156) (← links)
• Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types (Q1929140) (← links)
• Assigning papers to referees (Q1959732) (← links)
• Size versus truncation robustness in the assignment problem (Q1985723) (← links)
• Random assignments of bundles (Q1985726) (← links)
• Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
• Partial strategyproofness: relaxing strategyproofness for the random assignment problem (Q1995295) (← links)
• Stepwise ordinal efficiency for the random assignment problem (Q1996179) (← links)
• Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
• On the existence of Pareto efficient and envy-free allocations (Q2025008) (← links)
• A solution to the two-person implementation problem (Q2025052) (← links)
• Fairness and efficiency for allocations with participation constraints (Q2044984) (← links)
• Random assignments and outside options (Q2058870) (← links)
• Ex-post favoring ranks: a fairness notion for the random assignment problem (Q2059097) (← links)
• Sequential school choice: theory and evidence from the field and lab (Q2067353) (← links)
• Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
• Tight social welfare approximation of probabilistic serial (Q2089061) (← links)
• College assignment problems under constrained choice, private preferences, and risk aversion (Q2099060) (← links)