Salvato in:
Dettagli Bibliografici
Autori principali: Hirai, Hiroshi, Sato, Ryosuke
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:https://arxiv.org/abs/2303.00231
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916465140039680
author Hirai, Hiroshi
Sato, Ryosuke
author_facet Hirai, Hiroshi
Sato, Ryosuke
contents In this study, we propose the polyhedral clinching auction for indivisible goods, which has so far been studied for divisible goods. As in the divisible setting by Goel et al. (2015), our mechanism enjoys incentive compatibility, individual rationality, and Pareto optimality, and works with polymatroidal environments. A notable feature for the indivisible setting is that the whole procedure can be conducted in time polynomial of the number of buyers and goods. Moreover, we show additional efficiency guarantees, recently established by Sato for the divisible setting: The liquid welfare (LW) of our mechanism achieves more than 1/2 of the optimal LW, and that the social welfare is more than the optimal LW.
format Preprint
id arxiv_https___arxiv_org_abs_2303_00231
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Polyhedral Clinching Auctions for Indivisible Goods
Hirai, Hiroshi
Sato, Ryosuke
Computer Science and Game Theory
91B26
In this study, we propose the polyhedral clinching auction for indivisible goods, which has so far been studied for divisible goods. As in the divisible setting by Goel et al. (2015), our mechanism enjoys incentive compatibility, individual rationality, and Pareto optimality, and works with polymatroidal environments. A notable feature for the indivisible setting is that the whole procedure can be conducted in time polynomial of the number of buyers and goods. Moreover, we show additional efficiency guarantees, recently established by Sato for the divisible setting: The liquid welfare (LW) of our mechanism achieves more than 1/2 of the optimal LW, and that the social welfare is more than the optimal LW.
title Polyhedral Clinching Auctions for Indivisible Goods
topic Computer Science and Game Theory
91B26
url https://arxiv.org/abs/2303.00231