English
Related papers

Related papers: Descending Price Optimally Coordinates Search

200 papers

This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential auctions, simultaneous auctions, and the Trading Agent…

Computer Science and Game Theory · Computer Science 2012-07-19 Amy Greenwald , Justin Boyan

Consumers can acquire information through their own search efforts or through their social network. Information diffusion via word-of-mouth communication leads to some consumers free-riding on their "friends" and less information…

Theoretical Economics · Economics 2021-10-01 Atabek Atayev , Maarten Janssen

We study statistical parameter estimation in the setting of data markets. A buyer seeks to estimate a parameter based on samples that can be purchased from competing providers that differ in their data quality and provision costs. When…

Computer Science and Game Theory · Computer Science 2026-04-13 Yuchen Hu , Martin J. Wainwright , Stephen Bates

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition.…

Quantum Physics · Physics 2007-11-26 Tad Hogg , Pavithra Harsha , Kay-Yut Chen

Simultaneous item auctions are simple procedures for allocating items to bidders with potentially complex preferences over different item sets. In a simultaneous auction, every bidder submits bids on all items simultaneously. The allocation…

Computer Science and Game Theory · Computer Science 2012-09-24 Michal Feldman , Hu Fu , Nick Gravin , Brendan Lucier

We study the optimal behavior of a bidder in a real-time auction subject to the requirement that a specified collections of heterogeneous items be acquired within given time constraints. The problem facing this bidder is cast as a…

Computational Engineering, Finance, and Science · Computer Science 2021-11-17 Ryan J. Kinnear , Ravi R. Mazumdar , Peter Marbach

First-price auctions have largely replaced traditional bidding approaches based on Vickrey auctions in programmatic advertising. As far as learning is concerned, first-price auctions are more challenging because the optimal bidding strategy…

Machine Learning · Computer Science 2021-11-23 Juliette Achddou , Olivier Cappé , Aurélien Garivier

Unexpected advertising items in sponsored search may reduce users' reliance on organic search, resulting in hidden cost for the e-commerce platform. To address this problem and promote sustainable growth, we propose a dynamic reserve price…

Computer Science and Game Theory · Computer Science 2025-08-26 Mang Li

We study equilibria in two-buyer sequential second-price (or first-price) auctions for identical goods. Buyers have weakly decreasing incremental values, and we make a behavioural no-overbidding assumption: the buyers do not bid above their…

Computer Science and Game Theory · Computer Science 2020-06-08 Mete Şeref Ahunbay , Brendan Lucier , Adrian Vetta

Good economic mechanisms depend on the preferences of participants in the mechanism. For example, the revenue-optimal auction for selling an item is parameterized by a reserve price, and the appropriate reserve price depends on how much the…

Computer Science and Game Theory · Computer Science 2014-06-10 Shuchi Chawla , Jason Hartline , Denis Nekipelov

In a recent publication, using a simple two-period model, which is already capable to capture essential non-convex multiperiod bids, Richstein et al. have shown that in the case of optimal bidding, multi-part bidding always ensures a higher…

General Economics · Economics 2025-10-09 Dávid Csercsik , Mihály András Vághy

Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Karhan Akcoglu , James Aspnes , Bhaskar DasGupta , Ming-Yang Kao

Optimal mechanism design enjoys a beautiful and well-developed theory, and also a number of killer applications. Rules of thumb produced by the field influence everything from how governments sell wireless spectrum licenses to how the major…

Computer Science and Game Theory · Computer Science 2014-09-23 Tim Roughgarden

The Generalized Second Price (GSP) auction used typically to model sponsored search auctions does not include the notion of budget constraints, which is present in practice. Motivated by this, we introduce the different variants of GSP…

Computer Science and Game Theory · Computer Science 2013-09-27 Josep Diaz , Ioannis Giotis , Lefteris Kirousis , Evangelos Markakis , Maria Serna

When customers must visit a seller to learn the valuation of its product, sellers potentially benefit from charging a lower price on the first visit and a higher price when a buyer returns. Armstrong and Zhou (2016) show that such price…

Theoretical Economics · Economics 2025-12-10 Wojciech Olszewski , Yutong Zhang

The existing studies on consumer search agree that consumers are worse-off when they do not observe sellers' production marginal cost than when they do. In this paper we challenge this conclusion. Employing a canonical model of simultaneous…

Theoretical Economics · Economics 2022-06-10 Atabek Atayev

Shilling is the use of artificial bids to make competition appear stronger and push prices upward. We study repeated first-price auctions in which shilling affects feedback but not allocation: the learner wins or loses against the real…

Machine Learning · Statistics 2026-05-22 Luigi Foscari , Matilde Tullii , Vianney Perchet

The progressive second-price auction of Lazar and Semret is a decentralized mechanism for the allocation and real-time pricing of a divisible resource. Our focus is on how delays in the receipt of bid messages, asynchronous analysis by…

Computer Science and Game Theory · Computer Science 2025-11-24 Jordana Blazek , Eric Olson , Fredrick C. Harris

We consider auctions with N+1 bidders. Of these, N are symmetric and N+1 is "sufficiently strong" relative to the others. The auction is a "tournament" in which the first N players bid to win the right to compete with N+1. The bids of the…

Theoretical Economics · Economics 2024-09-18 Luca Anderlini , GaOn Kim

We explore a model of duopolistic competition in which consumers learn about the fit of each competitor's product. In equilibrium, consumers comparison shop: they learn only about the relative values of the products. When information is…

Theoretical Economics · Economics 2023-04-18 Brian C. Albrecht , Mark Whitmeyer