Incentives in the probabilistic serial mechanism

From MaRDI portal
Publication:848608

DOI10.1016/j.jet.2009.09.002zbMath1202.91061OpenAlexW2010264963MaRDI QIDQ848608

Fuhito Kojima, Mihai Manea

Publication date: 4 March 2010

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2009.09.002




Related Items

Fairness and efficiency in strategy-proof object allocation mechanismsEfficient lottery designConvex strategyproofness with an application to the probabilistic serial mechanismThe welfare effects of pre-arrangements in matching marketsAssignment problems with complementaritiesAn equilibrium analysis of the probabilistic serial mechanismProbabilistic assignment: an extension approachConstrained random matchingThe object allocation problem with random prioritiesMatching in the large: an experimental studyImproving schools through school choice: a market design approachStability in Large Matching Markets with ComplementaritiesRandom assignments on sequentially dichotomous domainsReassignment-proof rules for land rental problemsAxiomatic characterizations of the constrained probabilistic serial mechanismStrategy-proof stochastic assignmentFictitious students creation incentives in school choice problemsOptimal assignment mechanisms with imperfect verificationStrategy-proof and envy-free mechanisms for house allocationOn wastefulness of random assignments in discrete allocation problemsOrdinal Bayesian incentive compatibility in random assignment modelImpossibilities for probabilistic assignmentA planner-optimal matching mechanism and its incentive compatibility in a restricted domainReallocation with prioritiesEfficient resource allocation under multi-unit demandWelfare theorems for random assignments with prioritiesThe ``Boston school-choice mechanism: an axiomatic approachProbabilistic assignment of indivisible goods with single-peaked preferencesAn experimental study on the incentives of the probabilistic serial mechanismAssigning agents to a lineWhen is the probabilistic serial assignment uniquely efficient and envy-free?Partial strategyproofness: relaxing strategyproofness for the random assignment problemNon-manipulability of uniform price auctions with a large number of objectsThe probabilistic serial mechanism with private endowmentsA note on ex-ante stable lotteriesMaking just school assignmentsStrategy-proof and fair assignment is wastefulStable Matching in Large EconomiesRandom matching under priorities: stability and no envy conceptsThe losses from integration in matching markets can be largeSubmodular optimization views on the random assignment problemTight social welfare approximation of probabilistic serialRandom assignments on preference domains with a tier structure



Cites Work