English
Related papers

Related papers: Price Manipulability in First-Price Auctions

200 papers

In many applications, ads are displayed together with the prices, so as to provide a direct comparison among similar products or services. The price-displaying feature not only influences the consumers' decisions, but also affects the…

Artificial Intelligence · Computer Science 2023-03-24 Bin Li , Yahui Lei

Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of prior-free auction and focus on…

Computer Science and Game Theory · Computer Science 2009-09-30 Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction theory provides little guidance for dealing with this…

Computer Science and Game Theory · Computer Science 2012-07-09 Anna Osepayshvili , Michael P. Wellman , Daniel Reeves , Jeffrey K. MacKie-Mason

We study the efficiency of sequential first-price item auctions at (subgame perfect) equilibrium. This auction format has recently attracted much attention, with previous work establishing positive results for unit-demand valuations and…

Computer Science and Game Theory · Computer Science 2013-09-11 Michal Feldman , Brendan Lucier , Vasilis Syrgkanis

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

Learning to bid in repeated first-price auctions is a fundamental problem at the interface of game theory and machine learning, which has seen a recent surge in interest due to the transition of display advertising to first-price auctions.…

Computer Science and Game Theory · Computer Science 2024-07-09 Rachitesh Kumar , Jon Schneider , Balasubramanian Sivan

In this paper, we study the problem of learning to bid in repeated first-price auctions with budget constraints. In each period, the decision maker needs to submit a bid to win the auction and maximize the total collected reward, subject to…

Optimization and Control · Mathematics 2026-03-10 Zeng Fu , Jiashuo Jiang , Yuan Zhou

Lately, Non-Fungible Tokens (NFTs), i.e., uniquely discernible assets on a blockchain, have skyrocketed in popularity by addressing a broad audience. However, the typical NFT auctioning procedures are conducted in various, ad hoc ways,…

Computer Science and Game Theory · Computer Science 2022-09-26 Jason Milionis , Dean Hirsch , Andy Arditi , Pranav Garimidi

We consider the computational complexity of computing Bayes-Nash equilibria in first-price auctions, where the bidders' values for the item are drawn from a general (possibly correlated) joint distribution. We show that when the values and…

Computer Science and Game Theory · Computer Science 2025-06-06 Aris Filos-Ratsikas , Yiannis Giannakopoulos , Alexandros Hollender , Charalampos Kokkalis

We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal…

Computer Science and Game Theory · Computer Science 2025-05-27 David X. Lin , Daniel Hall , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class,…

Computer Science and Game Theory · Computer Science 2016-06-01 Jacob Abernethy , Sébastien Lahaie , Matus Telgarsky

We study the problem of repeatedly auctioning off an item to one of $k$ bidders where: a) bidders have a per-round individual rationality constraint, b) bidders may leave the mechanism at any point, and c) the bidders' valuations are…

Computer Science and Game Theory · Computer Science 2021-03-03 Mark Braverman , Jon Schneider , S. Matthew Weinberg

Today, many auctions are carried out with the help of intermediary platforms like Google and eBay. We refer to such auctions as platform-assisted auctions.Traditionally, the auction theory literature mainly focuses on designing auctions…

Computer Science and Game Theory · Computer Science 2025-01-07 Hao Chung , Ke Wu , Elaine Shi

We employ a 2x3 factorial experiment to study two central factors in the design of prediction markets (PMs) for idea evaluation: the overall design of the PM, and the elasticity of market prices set by a market maker. The results show that…

Social and Information Networks · Computer Science 2012-04-17 Ivo Blohm , Christoph Riedl , Johann Füller , Orhan Köroglu , Jan Marco Leimeister , Helmut Krcmar

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

Prices in financial markets exhibit extreme jumps far more often than can be accounted for by external news. Further, magnitudes of price changes are correlated over long times. These so called stylized facts are quantified by scaling laws…

Trading and Market Microstructure · Quantitative Finance 2016-05-04 Felix Patzelt , Klaus Pawelzik

To choose between two discrete goods, a consumer pays attention to only those with prices below a threshold. From these, she chooses her most preferred good. We assume consumers in a population have the same preference but may have…

Theoretical Economics · Economics 2025-11-07 Kaushil Patel

Designing an incentive-compatible auction mechanism that maximizes the auctioneer's revenue while minimizes the bidders' ex-post regret is an important yet intricate problem in economics. Remarkable progress has been achieved through…

Computer Science and Game Theory · Computer Science 2022-10-12 Tian Qin , Fengxiang He , Dingfeng Shi , Wenbing Huang , Dacheng Tao

Prediction markets mobilize financial incentives to forecast binary event outcomes through the aggregation of dispersed beliefs and heterogeneous information. Their growing popularity and demonstrated predictive accuracy in political…

General Economics · Economics 2026-01-29 Bridget Smart , Ebba Mark , Anne Bastian , Josefina Waugh

We study independent private values auction environments in which the auctioneer's revenue depends nonlinearly on bidders' interim winning probabilities. Our framework accommodates heterogeneity among bidders and places no ad hoc…

Theoretical Economics · Economics 2026-02-23 Pasha Andreyanov , Ilia Krasikov , Alex Suzdaltsev
‹ Prev 1 4 5 6 7 8 10 Next ›