skip to main content
10.1145/3033274.3084089acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
abstract

Dynamic Mechanisms with Martingale Utilities

Published: 20 June 2017 Publication History

Abstract

We study the dynamic mechanism design problem of a seller who repeatedly sells independent items to a buyer with private values. In this setting, the seller could potentially extract the entire buyer surplus by running efficient auctions and charging an upfront participation fee at the beginning of the horizon. In some markets, such as internet advertising, participation fees are not practical since buyers expect to inspect items before purchasing them. This motivates us to study the design of dynamic mechanisms under successively more stringent requirements that capture the implicit business constraints of these markets. We first consider a periodic individual rationality constraint, which limits the mechanism to charge at most the buyer's value in each period. While this prevents large upfront participation fees, the seller can still design mechanisms that spread a participation fee across the first few auctions. These mechanisms have the unappealing feature that they provide close-to-zero buyer utility in earlier auctions in exchange for higher utility in later auctions. To address this problem, we introduce a {martingale utility constraint, which imposes the requirement that from the perspective of the buyer, the next item's expected utility is equal to the present one's. Our main result is providing a dynamic auction satisfying martingale utility and periodic individual rationality whose loss in profit with respect to first-best (full extraction of buyer surplus) is optimal up to polylogarithmic factors. The proposed mechanism is a dynamic two-tier auction with a hard floor and a soft floor that allocates the item whenever the buyer's bid is above the hard floor and charges the minimum of the bid and the soft floor.

Cited By

View all
  • (2021)Prior-free Dynamic Mechanism Design With Limited LiabilityProceedings of the 22nd ACM Conference on Economics and Computation10.1145/3465456.3467654(204-223)Online publication date: 18-Jul-2021
  • (2019)Prior-free dynamic auctions with low regret buyersProceedings of the 33rd International Conference on Neural Information Processing Systems10.5555/3454287.3454719(4803-4813)Online publication date: 8-Dec-2019
  • (2019)Learning to Bid in Revenue Maximizing AuctionCompanion Proceedings of The 2019 World Wide Web Conference10.1145/3308560.3316527(934-935)Online publication date: 13-May-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '17: Proceedings of the 2017 ACM Conference on Economics and Computation
June 2017
740 pages
ISBN:9781450345279
DOI:10.1145/3033274
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 June 2017

Check for updates

Qualifiers

  • Abstract

Conference

EC '17
Sponsor:
EC '17: ACM Conference on Economics and Computation
June 26 - 30, 2017
Massachusetts, Cambridge, USA

Acceptance Rates

EC '17 Paper Acceptance Rate 75 of 257 submissions, 29%;
Overall Acceptance Rate 664 of 2,389 submissions, 28%

Upcoming Conference

EC '25
The 25th ACM Conference on Economics and Computation
July 7 - 11, 2025
Stanford , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)1
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Prior-free Dynamic Mechanism Design With Limited LiabilityProceedings of the 22nd ACM Conference on Economics and Computation10.1145/3465456.3467654(204-223)Online publication date: 18-Jul-2021
  • (2019)Prior-free dynamic auctions with low regret buyersProceedings of the 33rd International Conference on Neural Information Processing Systems10.5555/3454287.3454719(4803-4813)Online publication date: 8-Dec-2019
  • (2019)Learning to Bid in Revenue Maximizing AuctionCompanion Proceedings of The 2019 World Wide Web Conference10.1145/3308560.3316527(934-935)Online publication date: 13-May-2019
  • (2018)Testing Incentive Compatibility in Display Ad AuctionsProceedings of the 2018 World Wide Web Conference10.1145/3178876.3186047(1419-1428)Online publication date: 10-Apr-2018
  • (2018)Dynamic Mechanism Design in the FieldProceedings of the 2018 World Wide Web Conference10.1145/3178876.3186041(1359-1368)Online publication date: 10-Apr-2018
  • (2017)Online Optimization for Markets and the CloudACM SIGMETRICS Performance Evaluation Review10.1145/3143314.307850745:1(47-48)Online publication date: 5-Jun-2017
  • (2017)Online Optimization for Markets and the CloudProceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems10.1145/3078505.3078507(47-48)Online publication date: 5-Jun-2017
  • (undefined)Dynamic Mechanism Design in the FieldSSRN Electronic Journal10.2139/ssrn.2956713

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media