A Graph Theoretic Approach to the Slot Allocation Problem

Youngsub Chun and Boram Park

Working Paper Series from Institute of Economic Research, Seoul National University

Abstract: We consider a problem of assigning slots to a group of agents. Each slot can serve only one agent at a time and it is located along a line. Each agent has a most preferred slot and incurs disutility when she is assigned away from the most preferred slot. Furthermore, we assume that each agent¡¯s utility is equal to the amount of monetary transfer minus the distance from the peak to her assigned slot. In this paper, we investigate how to assign slots to agents in an efficient and fair way. First, by using a bipartite graph of the slot allocation problem, we present a simple way of identifying all efficient assignments. Next, we introduce two allocation rules for the problem, the leximin and the leximax rules, and discuss their properties.

Date: 2014-10
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://ier.snu.ac.kr/activity/working-papers?md=download&seqidx=33

Related works:
Journal Article: A graph theoretic approach to the slot allocation problem (2017)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:snu:ioerwp:no92

Access Statistics for this paper

More papers in Working Paper Series from Institute of Economic Research, Seoul National University Contact information at EDIRC.
Bibliographic data for series maintained by Hojung Lee ().