A new solution to the random assignment problem.
From MaRDI portal
Recommendations
- A solution to the random assignment problem on the full preference domain
- A simple random assignment problem with a unique solution
- An equilibrium analysis of the probabilistic serial mechanism
- Fair solutions to the random assignment problem
- The probabilistic serial mechanism with private endowments
Cites work
- A simple random assignment problem with a unique solution
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- On a conjecture by Gale about one-sided matching problems
- On cores and indivisibility
- Ordinal efficiency and dominated sets of assignments.
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Scheduling with Opting Out: Improving upon Random Priority
- Straightforwardness of Game Forms with Lotteries as Outcomes
Cited in
(only showing first 100 items - show all)- Random assignment of multiple indivisible objects
- Random assignment under weak preferences
- An experimental examination into the design of decentralized methods to solve the assignment problem with and without money
- Ordinal efficiency and dominated sets of assignments.
- The evolution of exchange.
- The \textit{ex ante} incentive compatible core of the assignment game.
- The generalized random priority mechanism with budgets
- Fair solutions to the random assignment problem
- Probabilistic assignment: an extension approach
- On the tradeoff between efficiency and strategyproofness
- The object allocation problem with random priorities
- Matching in the large: an experimental study
- The impossibility of extending random dictatorship to weak preferences
- Weighted randomized dictatorship and the asymmetric Nash solution
- Equivalence of efficiency notions for ordinal assignment problems
- Fractional group identification
- On the consistency of random serial dictatorship
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
- Computational aspects of assigning agents to a line
- Impossibilities for probabilistic assignment
- Fair student placement
- A marriage matching mechanism menagerie
- Efficient and fair assignment mechanisms are strongly group manipulable
- Handling preferences in student-project allocation
- Designing mechanisms to focalize welfare-improving strategies
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
- A note on the assignment problem with uniform preferences
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences
- Strategy-proofness and population-monotonicity for house allocation problems
- Strategic candidacy for multivalued voting procedures
- Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types
- Assigning papers to referees
- Size versus truncation robustness in the assignment problem
- Random assignments of bundles
- Upper-contour strategy-proofness in the probabilistic assignment problem
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- Stepwise ordinal efficiency for the random assignment problem
- Compromises and rewards: stable and non-manipulable probabilistic matching
- On the existence of Pareto efficient and envy-free allocations
- A solution to the two-person implementation problem
- Fairness and efficiency for allocations with participation constraints
- Random assignments and outside options
- Ex-post favoring ranks: a fairness notion for the random assignment problem
- Sequential school choice: theory and evidence from the field and lab
- Efficient mixtures of priority rules for assigning objects
- Tight social welfare approximation of probabilistic serial
- College assignment problems under constrained choice, private preferences, and risk aversion
- A pessimist's approach to one-sided matching
- Trading probabilities along cycles
- Constrained random matching
- Matching and scheduling of student-company-talks for a university it-speed dating event
- Information acquisition and provision in school choice: a theoretical investigation
- Multi-unit assignment under dichotomous preferences
- Random assignments on sequentially dichotomous domains
- Continuity and incentive compatibility in cardinal mechanisms
- Local vs. global strategy-proofness: a new equivalence result for ordinal mechanisms
- On endowments and indivisibility: partial ownership in the Shapley-Scarf model
- Fair-by-design matching
- Welfare theorems for random assignments with priorities
- Ex-post incentive compatible and individually rational assignments in housing markets with interdependent values
- Foundations of pseudomarkets: Walrasian equilibria for discrete resources
- Information acquisition and provision in school choice: an experimental study
- Peeking behind the ordinal curtain: improving distortion via cardinal queries
- Extended random assignment mechanisms on a family of good sets
- Efficient reallocation under additive and responsive preferences
- Corrigendum to ``Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching
- When are efficient and fair assignment mechanisms group strategy-proof?
- Notions of anonymity for object assignment: impossibility theorems
- Short trading cycles: paired kidney exchange with strict ordinal preferences
- Ex-ante efficiency in assignments with seniority rights
- On the terminology of economic design: a critical assessment and some proposals
- Size versus truthfulness in the house allocation problem
- Submodular optimization views on the random assignment problem
- Efficient rules for probabilistic assignment
- Random assignments on preference domains with a tier structure
- Size versus fairness in the assignment problem
- Fairness and efficiency in strategy-proof object allocation mechanisms
- Efficient lottery design
- A graph theoretic approach to the slot allocation problem
- Strategy-proof assignment on the full preference domain
- House allocation with existing tenants: an equivalence
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
- A task-allocation problem
- A two-objective fuzzy \(k\)-cardinality assignment problem
- Reclaim-proof allocation of indivisible objects
- Efficient resource allocation under multi-unit demand
- A note on object allocation under lexicographic preferences
- Matching mechanisms and matching quality: evidence from a top university in China
- A general equivalence theorem for allocation of indivisible objects
- The ``Boston school-choice mechanism: an axiomatic approach
- Markovian assignment rules
- Probabilistic assignment of indivisible goods with single-peaked preferences
- The extended serial correspondence on a rich preference domain
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- Serial dictatorship and Pareto optimality
- Random serial dictatorship and ordinally efficient contracts
This page was built for publication: A new solution to the random assignment problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958895)
