Efficient Priority Rules

L.H. Ehlers; B.E. Klaus

doi:10.1016/j.geb.2005.02.009

Efficient Priority Rules

L.H. Ehlers^*, B.E. Klaus

^*Corresponding author for this work

Microeconomics & Public Economics

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We study the assignment of indivisible objects with quotas (universities, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and reallocation-consistency. Such a rule respects an acyclic priority structure and the allocations are determined using the deferred acceptance algorithm.

Original language	English
Pages (from-to)	372-384
Number of pages	13
Journal	Games and Economic Behavior
Volume	55
DOIs	https://doi.org/10.1016/j.geb.2005.02.009
Publication status	Published - 1 Jan 2006

Access to Document

10.1016/j.geb.2005.02.009

Cite this

@article{eba78e7c36844b72b4f88e7605958917,

title = "Efficient Priority Rules",

abstract = "We study the assignment of indivisible objects with quotas (universities, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and reallocation-consistency. Such a rule respects an acyclic priority structure and the allocations are determined using the deferred acceptance algorithm.",

author = "L.H. Ehlers and B.E. Klaus",

year = "2006",

month = jan,

day = "1",

doi = "10.1016/j.geb.2005.02.009",

language = "English",

volume = "55",

pages = "372--384",

journal = "Games and Economic Behavior",

issn = "0899-8256",

publisher = "Elsevier",

}

TY - JOUR

T1 - Efficient Priority Rules

AU - Ehlers, L.H.

AU - Klaus, B.E.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - We study the assignment of indivisible objects with quotas (universities, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and reallocation-consistency. Such a rule respects an acyclic priority structure and the allocations are determined using the deferred acceptance algorithm.

AB - We study the assignment of indivisible objects with quotas (universities, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and reallocation-consistency. Such a rule respects an acyclic priority structure and the allocations are determined using the deferred acceptance algorithm.

U2 - 10.1016/j.geb.2005.02.009

DO - 10.1016/j.geb.2005.02.009

M3 - Article

SN - 0899-8256

VL - 55

SP - 372

EP - 384

JO - Games and Economic Behavior

JF - Games and Economic Behavior

ER -

Efficient Priority Rules

Abstract

Access to Document

Fingerprint

Cite this