Name
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. By using a bipartite graph of the slot allocation problem, we first 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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00355-016-0975-y | Social Choice and Welfare |
Field | DocType | Volume |
Graph,Mathematical optimization,Bipartite graph,Mathematics | Journal | 48 |
Issue | ISSN | Citations |
1 | 1432-217X | 1 |
PageRank | References | Authors |
0.37 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Youngsub Chun | 1 | 94 | 20.80 |
| boram park | 2 | 5 | 5.89 |