Clinching auctions with online supply

DOI10.1016/J.GEB.2015.11.008zbMath1452.91161arXiv1210.1456OpenAlexW2569738324MaRDI QIDQ2206820

Gagan Goel, Renato Paes Leme, Vahab S. Mirrokni

Publication date: 26 October 2020

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1456

zbMATH Keywords

online allocationauction designonline supply

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (3)

Polyhedral Clinching Auctions for Two-Sided Markets ⋮ Multiplicative Pacing Equilibria in Auction Markets ⋮ Fair Resource Allocation in a Volatile Marketplace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-unit auctions with budget limits
• Polyhedral Clinching Auctions and the AdWords Polytope
• An Ascending Vickrey Auction for Selling Bases of a Matroid
• On Multiple Keyword Sponsored Search Auctions with Budgets
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• AdWords and generalized online matching
• Optimal Auction Design
• Rado's theorem for polymatroids
• Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching

This page was built for publication: Clinching auctions with online supply