Polyhedral Clinching Auctions with a Single Sample

02/07/2023
by   Ryosuke Sato, et al.
0

In this study, we investigate auctions in two-sided markets with budget constraints on buyers. Our goal is to propose an efficient mechanism that satisfies dominant strategy incentive compatibility (DSIC), individual rationality (IR), and weak budget balance (WBB). To avoid several known impossibility theorems for each of two-sided markets and budget constraints, we assume prior information on sellers' valuations and investigate the efficiency of mechanisms by means of liquid welfare (LW), an efficiency measure used for budget-constrained auctions, in addition to social welfare (SW). Our first result is to improve the efficiency guarantees of the Polyhedral Clinching Auction by Hirai and Sato (2022), proposed for two-sided markets in which each seller is assumed to be truthful. We show that even under budget constraints and polymatroid constraints, their mechanism achieves an LW of more than 1/2 of the optimal LW, and an SW of more than the optimal LW. This significantly strengthens the efficiency guarantees of the existing studies on clinching auctions. Our second result is the extension of the Polyhedral Clinching Auction to a single-sample mechanism. Under the assumption that a single sample is provided from each seller's distribution on her valuation, we utilize the first result and propose an efficient mechanism that satisfies DSIC, IR, and WBB. Our mechanism achieves an LW of more than 1/4 of the optimal LW, and an SW of more than 1/2 of the optimal LW, in expectation. This result can be viewed as a budget extension of D"utting et al. (2021).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2017

Polyhedral Clinching Auctions for Two-sided Markets

In this paper, we present a new model and mechanism for auctions in two-...
research
07/07/2023

The Power of Two-sided Recruitment in Two-sided Markets

We consider the problem of maximizing the gains from trade (GFT) in two-...
research
05/12/2022

Core-Stability in Assignment Markets with Financially Constrained Buyers

We study markets where a set of indivisible items is sold to bidders wit...
research
08/19/2022

Mechanism Learning for Trading Networks

We study the problem of designing mechanisms for trading networks that s...
research
11/20/2019

Governance of Social Welfare in Networked Markets

This paper aims to investigate how a central authority (e.g. a governmen...
research
09/19/2023

Multi-Stage Generalized Deferred Acceptance Mechanism: Strategyproof Mechanism for Handling General Hereditary Constraints

The theory of two-sided matching has been extensively developed and appl...
research
03/17/2020

Efficient Two-Sided Markets with Limited Information

Many important practical markets inherently involve the interaction of s...

Please sign up or login with your details

Forgot password? Click here to reset