Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Collusive communication schemes in a first-price auction

Azacis, Helmuts ORCID: https://orcid.org/0000-0002-6061-2100 and Vida, Péter 2015. Collusive communication schemes in a first-price auction. Economic Theory 58 (1) , pp. 125-160. 10.1007/s00199-013-0778-7

Full text not available from this repository.

Abstract

We study optimal bidder collusion in an independent private value first-price auction with two bidders and two possible valuations. There is a benevolent center that knows the bidders’ valuations and sends private signals to the bidders in order to maximize their expected payoffs. After receiving their signals, bidders compete in a standard first-price auction, that is, without side payments or bid restrictions. We find that to improve on the bidders’ payoffs, the signals must depend upon the valuations. If the bidders’ signals are restricted to be non-correlated (depend only on the opponent’s valuation), then the bidders’ payoffs are strictly higher than the larger possible set of signals. If the signals are restricted to be perfectly correlated (public), only two possible signals are needed to achieve the highest bidder payoffs. However, these payoffs can be improved upon if the two signals are allowed to be imperfectly correlated.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Business (Including Economics)
Subjects: H Social Sciences > HB Economic Theory
H Social Sciences > HF Commerce
Uncontrolled Keywords: Bidder-optimal signal structure; Bid coordination mechanism; Collusion; (Bayes) correlated equilibrium; First-price auction; Public and private signals; D44; D82
Publisher: Springer Verlag (Germany)
ISSN: 0938-2259
Date of Acceptance: 24 September 2013
Last Modified: 27 Oct 2022 10:06
URI: https://orca.cardiff.ac.uk/id/eprint/68911

Citation Data

Cited 7 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item