Pseudonyms in Cost-Sharing Games

被引:0
|
作者
Penna, Paolo [1 ]
Schoppmann, Florian [2 ]
Silvestri, Riccardo [3 ]
Widmayer, Peter [4 ]
机构
[1] Univ Salerno, Dipartimento Informat & Applicaz, Via S Allende 2, Baronissi, SA, Italy
[2] Stanford Univ, Dept Comp Sci, Stamford, CT 94305 USA
[3] Univ Roma La Sapienza, Dipartimento Informat, I-00198 Rome, Italy
[4] Swiss Fed Inst Technol, Inst Theoret Informat, CH-8091 Zurich, Switzerland
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work initiates the study of cost-sharing mechanisms that, in addition to the usual incentive compatibility conditions, make it disadvantageous for the users to employ pseudonyms. We show that this is possible only if all serviced users pay the some price, which implies that such mechanisms do not exist even for certain subadditive cost functions. In practice, a user can increase her utility by lying in one way (misreport her willingness to pay) or another (misreport her identity). We prove also results for approximately budget-balanced mechanisms. Finally, we consider mechanisms that rely on some kind of "reputation" associated to the pseudonyms and show that they are provably better.
引用
收藏
页码:256 / +
页数:3
相关论文
共 50 条
  • [1] Cost-sharing in Parking Games
    Elder, Jennifer
    Harris, Pamela E.
    Kretschmann, Jan
    Mori, J. Carlos Martinez
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2024, 26 (03):
  • [2] Designing Cost-Sharing Methods for Bayesian Games
    Christodoulou, George
    Leonardi, Stefano
    Sgouritsa, Alkmini
    THEORY OF COMPUTING SYSTEMS, 2019, 63 (01) : 4 - 25
  • [3] Designing Cost-Sharing Methods for Bayesian Games
    Christodoulou, George
    Leonardi, Stefano
    Sgouritsa, Alkmini
    ALGORITHMIC GAME THEORY, SAGT 2016, 2016, 9928 : 327 - 339
  • [4] Optimal Price of Anarchy in Cost-Sharing Games
    Chandan, Rahul
    Paccagnan, Dario
    Marden, Jason R.
    2019 AMERICAN CONTROL CONFERENCE (ACC), 2019, : 2277 - 2282
  • [5] Designing Cost-Sharing Methods for Bayesian Games
    George Christodoulou
    Stefano Leonardi
    Alkmini Sgouritsa
    Theory of Computing Systems, 2019, 63 : 4 - 25
  • [6] Design Tradeoffs in Concave Cost-Sharing Games
    Phillips, Matthew
    Marden, Jason R.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 63 (07) : 2242 - 2247
  • [7] Optimal Cost-Sharing in Weighted Congestion Games
    Gkatzelis, Vasilis
    Kollias, Konstantinos
    Roughgarden, Tim
    WEB AND INTERNET ECONOMICS, 2014, 8877 : 72 - 88
  • [8] Optimal Cost-Sharing in General Resource Selection Games
    Gkatzelis, Vasilis
    Kollias, Konstantinos
    Roughgarden, Tim
    OPERATIONS RESEARCH, 2016, 64 (06) : 1230 - 1238
  • [9] Cost-Sharing Games with Rank-Based Utilities
    Rosner, Shaul
    Tamir, Tami
    ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 275 - 292
  • [10] Cost-sharing games with rank-based utilities
    Rosner, Shaul
    Tamir, Tami
    THEORETICAL COMPUTER SCIENCE, 2025, 1039