Positional scoring-based allocation of indivisible goods

被引:0
|
作者
Dorothea Baumeister
Sylvain Bouveret
Jérôme Lang
Nhan-Tam Nguyen
Trung Thanh Nguyen
Jörg Rothe
Abdallah Saffidine
机构
[1] Heinrich-Heine Universität Düsseldorf,LAMSADE
[2] Univ. Grenoble Alpes,undefined
[3] CNRS,undefined
[4] LIG,undefined
[5] Université Paris-Dauphine,undefined
[6] Place du Maréchal de Lattre de Tassigny,undefined
[7] Hai Phong University,undefined
[8] University of New South Wales,undefined
来源
Autonomous Agents and Multi-Agent Systems | 2017年 / 31卷
关键词
Computational social choice; Resource allocation; Fair division; Indivisible goods; Preferences;
D O I
暂无
中图分类号
学科分类号
摘要
We define a family of rules for dividing m indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents’ preferences over sets of goods are additive, but that the input is ordinal: each agent reports her preferences simply by ranking single goods. Similarly to positional scoring rules in voting, a scoring vector s=(s1,…,sm)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s = (s_1, \ldots , s_m)$$\end{document} consists of m nonincreasing, nonnegative weights, where si\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_i$$\end{document} is the score of a good assigned to an agent who ranks it in position i. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function ⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\star $$\end{document} such as, typically, +\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$+$$\end{document} or min\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\min $$\end{document}. The rule associated with s and ⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\star $$\end{document} maps a profile to (one of) the allocation(s) maximizing social welfare. After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, and separability. Finally, we focus on the computation of winning allocations, and on their approximation: we show that for commonly used scoring vectors and aggregation functions this problem is NP-hard and we exhibit some tractable particular cases.
引用
收藏
页码:628 / 655
页数:27
相关论文
共 50 条
  • [31] A characterization of maximum Nash welfare for indivisible goods
    Suksompong, Warut
    ECONOMICS LETTERS, 2023, 222
  • [32] Fair division of mixed divisible and indivisible goods
    Bei, Xiaohui
    Li, Zihao
    Liu, Jinyan
    Liu, Shengxin
    Lu, Xinhang
    ARTIFICIAL INTELLIGENCE, 2021, 293
  • [33] A characterization of maximum Nash welfare for indivisible goods
    Suksompong, Warut
    ECONOMICS LETTERS, 2023, 222
  • [34] Strategyproof exchange of indivisible goods
    Pápai, S
    JOURNAL OF MATHEMATICAL ECONOMICS, 2003, 39 (08) : 931 - 959
  • [35] Buying several indivisible goods
    Beviá, C
    Quinzii, M
    Silva, JA
    MATHEMATICAL SOCIAL SCIENCES, 1999, 37 (01) : 1 - 23
  • [36] Equitable Allocations of Indivisible Goods
    Freeman, Rupert
    Sikdar, Sujoy
    Vaish, Rohit
    Xia, Lirong
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 280 - 286
  • [37] Population monotonicity in fair division of multiple indivisible goods
    Dogan, Emre
    INTERNATIONAL JOURNAL OF GAME THEORY, 2021, 50 (02) : 361 - 376
  • [38] Population monotonicity in fair division of multiple indivisible goods
    Emre Doğan
    International Journal of Game Theory, 2021, 50 : 361 - 376
  • [39] Manipulation games in economies with indivisible goods
    Carmen Beviá
    International Journal of Game Theory, 2010, 39 : 209 - 222
  • [40] Bundling in exchange markets with indivisible goods
    Klaus, Bettina
    Dimitrov, Dinko
    Haake, Claus-Jochen
    ECONOMICS LETTERS, 2006, 93 (01) : 106 - 110