A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation

被引：33

作者：

Aziz, Haris ^{[1
,2
]}

Moulin, Herve ^{[3
,4
]}

Sandomirskiy, Fedor ^{[4
,5
]}

机构：

[1] UNSW Sydney, Sydney, NSW, Australia

[2] Data61 CSIRO, Sydney, NSW, Australia

[3] Univ Glasgow, Glasgow, Lanark, Scotland

[4] Higher Sch Econ, St Petersburg, Russia

[5] Technion, Haifa, Israel

来源：

OPERATIONS RESEARCH LETTERS | 2020年 / 48卷 / 05期

基金：

俄罗斯基础研究基金会; 欧洲研究理事会;

关键词：

Fair division; Pareto optimality; Proportionality;

D O I：

10.1016/j.orl.2020.07.005

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider fair allocation of indivisible items under additive utilities. We show that there exists a strongly polynomial-time algorithm that always computes an allocation satisfying Pareto optimality and proportionality up to one item even if the utilities are mixed and the agents have asymmetric weights. The result does not hold if either of Pareto optimality or PROP1 is replaced with slightly stronger concepts. (C) 2020 Elsevier B.V. All rights reserved.

引用

页码：573 / 578

页数：6

共 50 条

[1] Polynomial-time algorithm for computing bound sets
Krenz, R.
Dubrova, E.
[J]. IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2006, 153 (02): : 179 - 184
[2] COMPUTING THE OPTIMAL IO SEQUENCES OF A PROTOCOL IN POLYNOMIAL-TIME
CHEN, WH
CHUAN, YT
[J]. INFORMATION PROCESSING LETTERS, 1991, 40 (03) : 145 - 148
[3] Polynomial-time Algorithm for Distributed Server Allocation Problem
Sawa, Takaaki
He, Fujun
Kawabata, Akio
Oki, Eiji
[J]. PROCEEDING OF THE 2019 IEEE 8TH INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET), 2019,
[4] A polynomial-time algorithm for computing absolutely normal numbers
Becher, Veronica
Ariel Heiber, Pablo
Slaman, Theodore A.
[J]. INFORMATION AND COMPUTATION, 2013, 232 : 1 - 9
[5] A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE YOLK IN FIXED DIMENSION
TOVEY, CA
[J]. MATHEMATICAL PROGRAMMING, 1992, 57 (02) : 259 - 277
[6] A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR DYNAMIC STORAGE-ALLOCATION
KIERSTEAD, HA
[J]. DISCRETE MATHEMATICS, 1991, 88 (2-3) : 231 - 237
[7] A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING AN OPTIMAL ADMISSION POLICY IN GI/M/1/N QUEUE
MIZUNO, N
[J]. OPERATIONS RESEARCH LETTERS, 1986, 5 (04) : 197 - 200
[8] Polynomial-time algorithm for computing translocation distance between genomes
Hannenhalli, S
[J]. COMBINATORIAL PATTERN MATCHING, 1995, 937 : 162 - 176
[9] A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHS
Patel, Viresh
Stroh, Fabian
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (02) : 1363 - 1393
[10] Polynomial-time algorithm for computing translocation distance between genomes
Hannenhalli, S
[J]. DISCRETE APPLIED MATHEMATICS, 1996, 71 (1-3) : 137 - 151

← 1 2 3 4 5 →