MUDA: A Truthful Multi-Unit Double-Auction Mechanism

12/19/2017
by   Erel Segal-Halevi, et al.
0

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auctions, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee's mechanism handles single-parametric agents, allowing each seller to sell a single unit and each buyer to buy a single unit. This paper presents a double-auction mechanism that handles multi-parametric agents and allows multiple units per trader, as long as the valuation functions of all traders have decreasing marginal returns. The mechanism is prior-free, ex-post individually-rational, dominant-strategy truthful and strongly-budget-balanced. Its gain-from-trade approaches the optimum when the market size is sufficiently large.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2017

Truthful Bilateral Trade is Impossible even with Fixed Prices

A seminal theorem of Myerson and Satterthwaite (1983) proves that, in a ...
research
04/29/2019

Efficiency in Truthful Auctions via a Social Network

In this paper, we study efficiency in truthful auctions via a social net...
research
02/19/2019

Inference from Auction Prices

Econometric inference allows an analyst to back out the values of agents...
research
10/23/2017

Fixed Price Approximability of the Optimal Gain From Trade

Bilateral trade is a fundamental economic scenario comprising a strategi...
research
09/30/2019

A Price-Based Iterative Double Auction for Charger Sharing Markets

The unprecedented growth of demand for charging electric vehicles (EVs) ...
research
01/25/2022

Multi-unit Double Auctions: Equilibrium Analysis and Bidding Strategy using DDPG in Smart-grids

Periodic double auctions (PDA) have applications in many areas such as i...
research
11/13/2018

Multi-unit Bilateral Trade

We characterise the set of dominant strategy incentive compatible (DSIC)...

Please sign up or login with your details

Forgot password? Click here to reset