Towards characterizing the deterministic combinatorial constrained efficient space

Rica Gonen, Anat Lerner

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

תקציר

It is often the case that economic mechanisms can have hidden characteristics with unexpected consequences in practice. This is especially true when real-world budgets come into play. For instance, the infamous German and British 3G spectrum auctions that generated revenue so successfully that cellular service providers delayed the rollout of 3G networks for lack of funds. We contribute a piece of the puzzle by characterizing the space of deterministic, dominant-strategy incentive compatible, individually rational, and Pareto-optimal combinatorial auctions where efficiency does not hold. We examine a model with two players and k nonidentical items (2k outcomes), multidimensional types, private values, nonnegative prices, and quasilinear preferences for the players with one relaxation - one of the players is subject to a publicly-known budget constraint. We show that if it is publicly known that the valuation for the largest bundle is more than the budget for at least one of the players then the following are true. (a) VCG does not fulfill the basic properties of deterministic, dominant-strategy incentive compatible, individual rationality and Pareto optimality when the all-item bundle is not arbitrarily allocated. (b) Of the dictatorial solutions, only a single family of non-trivial dictatorial mechanisms fulfills the above basic properties. (c) Weakening the public knowledge assumption results in no VCG nor dictatorship mechanisms that fulfill the properties. Our characterization of the non-efficient space for deterministic budget-constrained combinatorial auctions is similar in spirit to that of [20] for Bayesian single-item constrained efficiency auctions.

שפה מקוריתאנגלית
כותר פרסום המארחAlgorithmic Decision Theory - 6th International Conference, ADT 2019, Proceedings
עורכיםSaša Pekec, Kristen Brent Venable
מוציא לאורSpringer
עמודים32-48
מספר עמודים17
מסת"ב (מודפס)9783030314880
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2019
אירוע6th International Conference on Algorithmic Decision Theory, ADT 2019 - Durham, ארצות הברית
משך הזמן: 25 אוק׳ 201927 אוק׳ 2019

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
כרך11834 LNAI
ISSN (מודפס)0302-9743
ISSN (אלקטרוני)1611-3349

כנס

כנס6th International Conference on Algorithmic Decision Theory, ADT 2019
מדינה/אזורארצות הברית
עירDurham
תקופה25/10/1927/10/19

הערה ביבליוגרפית

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Towards characterizing the deterministic combinatorial constrained efficient space'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי