In a scheduling problem where agents can opt out, we show that the familiar Random Priority (RP) a rule can be improved upon by another mechanism dubbed Probabilistic Serial (PS). Both mechanisms are nonmanipulable in a strong sense, but the latter is Pareto superior to the former and serves a larger (expected number of agents. The PS equilibrium outcome is easier to compute than the RP outcome; on the other hand RP is easier to implement than PS. We show that the improvement of PS over RP is significant but small: at most a couple of percentage points in the relative welfare gain and the relative difference in quantity served. We conjecture that the latter never exceeds 8.33 %. Both gains vanish when the number of agents is large.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Rice University, Department of Economics in its series Working Papers with number
2000-03.
For technical questions regarding this item, or to correct its listing, contact: ().
Related research
Keywords:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004.
"Pairwise Kidney Exchange,"
NBER Working Papers
10698, National Bureau of Economic Research, Inc.
[Downloadable!] (restricted)