The polyhedral geometry of truthful auctions

被引:0
|
作者
Joswig, Michael [1 ,2 ]
Klimm, Max [3 ]
Spitz, Sylvain [3 ]
机构
[1] Tech Univ Berlin, Discrete Math Geometry, Str 17 Juni 136, D-10623 Berlin, Germany
[2] Max Planck Inst Math Sci, Inselstr 22, D-04103 Leipzig, Germany
[3] Tech Univ Berlin, Discrete Optimizat, Str 17 Juni 136, D-10623 Berlin, Germany
关键词
MULTIDIMENSIONAL MECHANISM DESIGN; COMBINATORIAL AUCTIONS; MONOTONICITY; ALGORITHMS;
D O I
10.1007/s10107-024-02168-y
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The difference set of an outcome in an auction is the set of types that the auction mechanism maps to the outcome. We give a complete characterization of the geometry of the difference sets that can appear for a dominant strategy incentive compatible multi-unit auction showing that they correspond to regular subdivisions of the unit cube. Similarly, we describe the geometry for affine maximizers for n players and m items, showing that they correspond to regular subdivisions of the m-fold product of (n-1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(n-1)$$\end{document}-dimensional simplices. These observations are then used to construct mechanisms that are robust in the sense that the sets of items allocated to the players change only slightly when the players' reported types are changed slightly.
引用
收藏
页码:539 / 566
页数:28
相关论文
共 50 条
  • [31] Learning Utilities and Equilibria in Non-Truthful Auctions
    Fu, Hu
    Lin, Tao
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [32] TRUST: A General Framework for Truthful Double Spectrum Auctions
    Zhou, Xia
    Zheng, Heather
    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 999 - 1007
  • [33] Polyhedral Clinching Auctions for Indivisible Goods
    Hirai, Hiroshi
    Sato, Ryosuke
    ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 2025, 13 (01)
  • [34] Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
    Assadi, Sepehr
    Singla, Sahil
    ACM SIGECOM EXCHANGES, 2020, 18 (01) : 19 - 27
  • [35] Truthful Online Double Auctions for Dynamic Mobile Crowdsourcing
    Wei, Yueming
    Zhu, Yanmin
    Zhu, Hongzi
    Zhang, Qian
    Xue, Guangtao
    2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), 2015,
  • [36] An Impossibility Result for Truthful Combinatorial Auctions with Submodular Valuations
    Dobzinski, Shahar
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 139 - 147
  • [37] Auctioning a Cake: Truthful Auctions of Heterogeneous Divisible Goods
    Aumann, Yonatan
    Dombb, Yair
    Hassidim, Avinatan
    AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 1045 - 1052
  • [38] Polyhedral Clinching Auctions and the AdWords Polytope
    Goel, Gagan
    Mirrokni, Vahab
    Leme, Renato Paes
    JOURNAL OF THE ACM, 2015, 62 (03)
  • [39] Polyhedral Clinching Auctions and the Adwords Polytope
    Goel, Gagan
    Mirrokni, Vahab
    Leme, Renato Paes
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 107 - 121
  • [40] Truthful Spectrum Auctions With Approximate Social-Welfare or Revenue
    Al-Ayyoub, Mahmoud
    Gupta, Himanshu
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (06) : 1873 - 1885