Pages that link to "Item:Q5958895"
From MaRDI portal
The following pages link to A new solution to the random assignment problem. (Q5958895):
Displayed 50 items.
- Convex strategyproofness with an application to the probabilistic serial mechanism (Q284366) (← links)
- Assignment problems with complementarities (Q308621) (← links)
- Fairness and group-strategyproofness clash in assignment problems (Q308625) (← links)
- An equilibrium analysis of the probabilistic serial mechanism (Q328558) (← links)
- An alternative characterization of top trading cycles (Q372362) (← links)
- Strategy-proof stochastic assignment (Q402069) (← links)
- An average lexicographic value for cooperative games (Q421596) (← links)
- Random aggregation without the Pareto principle (Q427548) (← links)
- The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods (Q431227) (← links)
- Probabilistic assignment of objects: characterizing the serial rule (Q449195) (← links)
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853) (← links)
- Parametrized algorithms for random serial dictatorship (Q477775) (← links)
- An experimental study on the incentives of the probabilistic serial mechanism (Q485790) (← links)
- Assigning agents to a line (Q485809) (← links)
- A characterization of the extended serial correspondence (Q492874) (← links)
- Two simple variations of top trading cycles (Q496872) (← links)
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Pareto optimal matchings in many-to-many markets with ties (Q506537) (← links)
- On the operation of multiple matching markets (Q516981) (← links)
- Evaluating assignment without transfers: a market perspective (Q529775) (← links)
- Popular mixed matchings (Q541674) (← links)
- Efficiency under a combination of ordinal and cardinal information on preferences (Q553528) (← links)
- Decentralized pricing in minimum cost spanning trees (Q612004) (← links)
- An efficiency theorem for incompletely known preferences (Q617691) (← links)
- House allocation with fractional endowments (Q637577) (← links)
- Optimal mechanism design when both allocative inefficiency and expenditure inefficiency matter (Q660091) (← links)
- Cardinal Bayesian allocation mechanisms without transfers (Q665457) (← links)
- Symmetric mechanism design (Q684174) (← links)
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences (Q690970) (← links)
- Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences (Q697846) (← links)
- Ordinal efficiency and the polyhedral separating hyperplane theorem (Q697847) (← links)
- Consistency in the probabilistic assignment model (Q705901) (← links)
- Strategy-proof and fair assignment is wasteful (Q738936) (← links)
- Universal Pareto dominance and welfare for plausible utility functions (Q745015) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Truthful fair division without free disposal (Q826615) (← 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)
- Consistent house allocation (Q868626) (← links)
- Efficient assignment with interdependent values (Q896937) (← links)
- Random assignment: redefining the serial rule (Q896952) (← links)
- Decomposing random mechanisms (Q898659) (← links)
- Centralized allocation in multiple markets (Q898664) (← links)
- Random scheduling with deadlines under dichotomous preferences (Q898667) (← links)
- Welfare-maximizing assignment of agents to hierarchical positions (Q898694) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- A constructive proof of the ordinal efficiency welfare theorem (Q938066) (← links)
- Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm (Q965550) (← links)
- The probabilistic serial mechanism with private endowments (Q980972) (← links)