Competitive envy-free division

被引：4
|
作者：
Sung, SC
Vlach, M
机构：
[1] Japan Adv Inst Sci & Technol, Sch Informat Sci, Nomi, Ishikawa 9231292, Japan
[2] Charles Univ Prague, Fac Math & Phys, Prague 11800 1, Czech Republic
来源：
SOCIAL CHOICE AND WELFARE | 2004年 / 23卷 / 01期
关键词：
Finite Number; Efficient Procedure; Division Problem; Fair Division; Fair Division Problem;
D O I：
10.1007/s00355-003-0240-z
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
We are concerned with a fair division problem in which the indivisible "goods" to be distributed among a finite number of individuals have divisible "bads" associated with them. The problem is formulated and analyzed in terms of the housemates problem. We present an efficient procedure that decides whether an envy-free solution exists, and if so, finds one of them; otherwise finds a solution such that each envious housemate is assigned a room whose rent is zero.
引用
收藏
页码：103 / 111
页数：9
相关论文
共 50 条
  • [31] More than envy-free
    Sen, S
    Biswas, A
    [J]. FOURTH INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS, PROCEEDINGS, 2000, : 433 - 434
  • [32] Reforming an Envy-Free Matching
    Ito, Takehiro
    Iwamasa, Yuni
    Kakimura, Naonori
    Kamiyama, Naoyuki
    Kobayashi, Yusuke
    Nozaki, Yuta
    Okamoto, Yoshio
    Ozeki, Kenta
    [J]. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 5084 - 5091
  • [33] A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget
    Velez, Rodrigo A.
    [J]. SOCIAL CHOICE AND WELFARE, 2022, 59 (01) : 93 - 118
  • [34] Envy-free cake division without assuming the players prefer nonempty pieces
    Meunier, Frederic
    Zerbib, Shira
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 2019, 234 (02) : 907 - 925
  • [35] Envy-free cake division without assuming the players prefer nonempty pieces
    Frédéric Meunier
    Shira Zerbib
    [J]. Israel Journal of Mathematics, 2019, 234 : 907 - 925
  • [36] A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget
    Rodrigo A. Velez
    [J]. Social Choice and Welfare, 2022, 59 : 93 - 118
  • [37] ON THE IMPOSSIBILITY OF AN ENVY-FREE PARETIAN LIBERAL
    GEKKER, R
    [J]. JOURNAL OF ECONOMICS-ZEITSCHRIFT FUR NATIONALOKONOMIE, 1991, 53 (01): : 75 - 82
  • [38] Envy-Free Allocations for Budgeted Bidders
    Kempe, David
    Mu'alem, Ahuva
    Salek, Mahyar
    [J]. INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2009, 5929 : 537 - +
  • [39] Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
    Bouveret, Sylvain
    Endriss, Ulle
    Lang, Jerome
    [J]. ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 387 - 392
  • [40] Envy-Free Matchings with Lower Quotas
    Yu Yokoi
    [J]. Algorithmica, 2020, 82 : 188 - 211
12345