Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
نویسندگان
چکیده
The random priority (random serial dictatorship) mechanism is a common method for assigning objects to individuals. The mechanism is easy to implement and strategy-proof. However this mechanism is inefficient, as the agents may be made all better off by another mechanism that increases their chances of obtaining more preferred objects. Such an inefficiency is eliminated by the recent mechanism called probabilistic serial, but this mechanism is not strategy-proof. Thus, which mechanism to employ in practical applications has been an open question. This paper shows that these mechanisms become equivalent when the market becomes large. More specifically, given a set of object types, the random assignments in these mechanisms converge to each other as the number of copies of each object type approaches infinity. Thus, the inefficiency of the random priority mechanism becomes small in large markets. Our result gives some rationale for the common use of the random priority mechanism in practical problems such as student placement in public schools. JEL Classification Numbers: C70, D61, D63.
منابع مشابه
Why do popular mechanisms lack efficiency in random environments?
We consider the problem of randomly assigning n indivisible objects to n agents. Recent research introduced a promising mechanism, the probabilistic serial that has superior e¢ ciency properties than the most common real-life mechanism random priority. On the other hand, mechanisms based on Gales celebrated top trading cycles method have long dominated the indivisible goods literature (with th...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملProbabilistic Polynomial-Time Equivalence and Security Analysis
We use properties of observational equivalence for a proba-bilistic process calculus to prove an authentication property of a cryptographic protocol. The process calculus is a form of-calculus, with probabilistic scheduling instead of nondeterminism, over a term language that captures probabilistic polynomial time. The operational semantics of this calculus gives priority to communication over ...
متن کاملWhy do popular mechanisms lack e¢ ciency in random assignment problems?
We consider the problem of randomly assigning n indivisible objects to n agents. Recent research introduced a promising mechanism, the probabilistic serial that has superior e¢ ciency properties than the most common real-life mechanism random priroity. On the other hand, mechanisms based on Gales celebrated top trading cycles method have long dominated the indivisible goods literature (with th...
متن کاملA Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report)
We describe properties of a process calculus that has been developed for the purpose of analyzing security protocols. The process calculus is a restricted form of π-calculus, with bounded replication and probabilistic polynomial-time expressions allowed in messages and boolean tests. In order to avoid problems expressing security in the presence of nondeterminism, messages are scheduled probabi...
متن کامل