Double Auctions in Markets for Multiple Kinds of Goods

  title={Double Auctions in Markets for Multiple Kinds of Goods},
  author={Erel Segal-Halevi and Avinatan Hassidim and Yonatan Aumann},
Motivated by applications such as stock exchanges and spectrum auctions, there is a growing interest in mechanisms for arranging trade in two-sided markets. However, existing mechanisms are either not truthful, do not guarantee an asymptotically-optimal gain-from-trade, rely on a prior on the traders' valuations, or operate in limited settings such as a single type of good. We extend the random-sampling technique used in earlier works to multi-good markets where traders have gross-substitute… 

Tables from this paper

Strongly Budget Balanced Auctions for Multi-Sided Markets

A generalization of Segal-Halevi et al. (2016)'s strongly-budget-balanced double-sided auction setting to a multilateral market where each trade set is composed of any number of agent categories, which refines the notion of competition in multi-sided auctions by introducing the concepts of external competition and trade reduction.

Approximately Maximizing the Broker's Profit in a Two-sided Market

The Bayesian setting where the agents' values are independently drawn from prior distributions is considered, and an existing mechanism to production-cost markets is generalized in an approximation-preserving way and can be converted into an 8-approximation mechanism for two-sided markets.

On Multi-Dimensional Gains from Trade Maximization

This work presents the first worst-case approximation guarantee for gains from trade in a multi-dimensional two-sided market, and extends both results for a general constrained-additive buyer, losing another $O(\log n)-factor en-route.

Multi-unit Bilateral Trade

This work characterises the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting and presents some approximation results about the performance of certain mechanisms, in terms of social welfare.

Auction-Promoted Trading for Multiple Federated Learning Services in UAV-Aided Networks

This paper investigates a multiple FL service trading problem in Unmanned Aerial Vehicle (UAV)-aided networks, where FL service demanders (FLSDs) aim to purchase various data sets from feasible clients and model aggregation services from UAVs, to fulfil their requirements.

A Quality Aware Multiunit Double Auction Framework for IoT-Based Mobile Crowdsensing in Strategic Setting

A truthful mechanism is proposed for allocating the IoT devices to the sensing tasks carried by task requesters that also keep into account the quality of IoT devices.

G T ] 1 3 N ov 2 01 8 Multi-unit Bilateral Trade ∗

We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting.



MUDA: A Truthful Multi-Unit Double-Auction Mechanism

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.

SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism

SBBA is presented: a variant of McAfee’s mechanism which is strongly budget-balanced and generalize this variant to spatially-distributed markets with transit costs.

Market Research and Market Design

We study trading models when the distribution of signals such as costs or values is not known to traders or the mechanism designer when the profit-maximizing trading procedure is designed. We present

Competitive auctions and digital goods

It is shown that for any truthful auction, even a multi-price auction, the expected revenue does not exceed that for optimal fixed pricing, and a bound on how far the revenue can be from the total market utility is given.

Optimal Pricing Mechanisms with Unknown Demand

The standard profit-maximizing multi-unit auction can be represented as the Vickrey-Groves-Clarke mechanism in which the seller manipulates his reservation supply curve. The optimal supply curve

Fixed Price Approximability of the Optimal Gain from Trade

The GFT achievable by fixed price mechanisms is studied, showing that a more sophisticated rule for setting the fixed price results in a GFT within a factor \(O(\log (1/r))\) of the optimum, which is asymptotically the best approximation factor possible.

Modularity and greed in double auctions

This paper develops ``black-box reductions'' from double-auction design to the exhaustively-studied problem of designing single-sided mechanisms, and offers new insights into classic double-AUction designs, such as the VCG and McAfee auctions with unit-demand buyers and unit-supply sellers.

Approximately Efficient Two-Sided Combinatorial Auctions

An incentive compatible and budget balanced constant-factor approximation mechanism in a setting where buyers have XOS valuations and sellers' valuations are additive, the first such approximation mechanism for a two-sided market setting where the agents have combinatorial valuation functions.

Agent Competition Double-Auction Mechanism

Under the proposed double-auction mechanism, bidding one's true valuation (private information) is the best strategy for each individual buyer and seller even when shipping costs and sales taxes are different across various possible transactions.