English
Related papers

Related papers: Multiplicative Pacing Equilibria in Auction Market…

200 papers

In a sequential auction with multiple bidding agents, it is highly challenging to determine the ordering of the items to sell in order to maximize the revenue due to the fact that the autonomy and private information of the agents heavily…

Artificial Intelligence · Computer Science 2018-10-16 Sicco Verwer , Yingqian Zhang , Qing Chuan Ye

We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentially overlapping GAI clusters of attributes, thus decreases…

Computer Science and Game Theory · Computer Science 2014-01-17 Yagil Engel , Michael P. Wellman

In lowest unique bid auctions, $N$ players bid for an item. The winner is whoever places the \emph{lowest} bid, provided that it is also unique. We use a grand canonical approach to derive an analytical expression for the equilibrium…

Computer Science and Game Theory · Computer Science 2015-05-28 Simone Pigolotti , Sebastian Bernhardsson , Jeppe Juul , Gorm Galster , Pierpaolo Vivo

Algorithms increasingly automate bidding in online auctions, raising concerns about tacit bid suppression and revenue shortfalls. Prior work identifies individual mechanisms behind algorithmic bid suppression, but it remains unclear which…

General Economics · Economics 2026-03-24 Pranjal Rawat

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

Computer Science and Game Theory · Computer Science 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

Auction design for the modern advertising market has gained significant prominence in the field of game theory. With the recent rise of auto-bidding tools, an increasing number of advertisers in the market are utilizing these tools for…

Computer Science and Game Theory · Computer Science 2024-12-31 Changfeng Xu , Chao Peng , Chenyang Xu , Zhengfeng Yang

We study the problem of finding the optimal bidding strategy for an advertiser in a multi-platform auction setting. The competition on a platform is captured by a value and a cost function, mapping bidding strategies to value and cost…

Computer Science and Game Theory · Computer Science 2025-02-27 Gagan Aggarwal , Anupam Gupta , Xizhi Tan , Mingfei Zhao

This study explores the monotonicity of adaptive clinching auctions -- a key mechanism in budget-constrained auctions -- with respect to fluctuations in the number of bidders. Specifically, we investigate how the addition of new bidders…

Computer Science and Game Theory · Computer Science 2025-02-11 Ryosuke Sato

Electricity market operators worldwide use mixed-integer linear programming to solve the allocation problem in wholesale electricity markets. Prices are typically determined based on the duals of relaxed versions of this optimization…

Computer Science and Game Theory · Computer Science 2023-12-13 Mete Şeref Ahunbay , Martin Bichler , Teodora Dobos , Johannes Knörr

We investigate market forces that would lead to the emergence of new classes of players in the sponsored search market. We report a 3-fold diversification triggered by two inherent features of the sponsored search market, namely, capacity…

Computer Science and Game Theory · Computer Science 2007-11-05 Sudhir Kumar Singh , Vwani P. Roychowdhury , Himawan Gunadhi , Behnam A. Rezaei

We consider markets consisting of a set of indivisible items, and buyers that have {\em sharp} multi-unit demand. This means that each buyer $i$ wants a specific number $d_i$ of items; a bundle of size less than $d_i$ has no value, while a…

Computer Science and Game Theory · Computer Science 2015-03-13 Ning Chen , Xiaotie Deng , Paul. W. Goldberg , Jinshan Zhang

It has become the default in markets such as ad auctions for participants to bid in an auction through automated bidding agents (autobidders) which adjust bids over time to satisfy return-over-spend constraints. Despite the prominence of…

Computer Science and Game Theory · Computer Science 2024-07-03 Renato Paes Leme , Georgios Piliouras , Jon Schneider , Kelly Spendlove , Song Zuo

The growing demand for data and AI-generated digital goods, such as personalized written content and artwork, necessitates effective pricing and feedback mechanisms that account for uncertain utility and costly production. Motivated by…

Computer Science and Game Theory · Computer Science 2023-06-06 Zachary Robertson , Oluwasanmi Koyejo

Signaling is an important topic in the study of asymmetric information in economic settings. In particular, the transparency of information available to a seller in an auction setting is a question of major interest. We introduce the study…

Computer Science and Game Theory · Computer Science 2012-04-26 Yuval Emek , Michal Feldman , Iftah Gamzu , Renato Paes Leme , Moshe Tennenholtz

In non-truthful auctions such as first-price and all-pay auctions, the independent strategic behaviors of bidders, with the corresponding Bayes-Nash equilibrium notion, are notoriously difficult to characterize and can cause undesirable…

Computer Science and Game Theory · Computer Science 2025-10-28 Hu Fu , Tao Lin

We study a game played between advertisers in an online ad platform. The platform sells ad impressions by first-price auction and provides autobidding algorithms that optimize bids on each advertiser's behalf, subject to advertiser…

Computer Science and Game Theory · Computer Science 2023-11-16 Yiding Feng , Brendan Lucier , Aleksandrs Slivkins

We initiate the study of efficient mechanism design with guaranteed good properties even when players participate in multiple different mechanisms simultaneously or sequentially. We define the class of smooth mechanisms, related to smooth…

Computer Science and Game Theory · Computer Science 2012-11-07 Vasilis Syrgkanis , Eva Tardos

Trading large volumes of a financial asset in order driven markets requires the use of algorithmic execution dividing the volume in many transactions in order to minimize costs due to market impact. A proper design of an optimal execution…

Trading and Market Microstructure · Quantitative Finance 2015-06-05 Enzo Busseti , Fabrizio Lillo

We discuss bundle auctions within the framework of an integer allocation problem. We show that for multi-unit auctions, of which bundle auctions are a special case, market equilibrium and constrained market equilibrium are equivalent…

Computer Science and Game Theory · Computer Science 2007-05-23 Somdeb Lahiri

We use valid inequalities (cuts) of the binary integer program for winner determination in a combinatorial auction (CA) as "artificial items" that can be interpreted intuitively and priced to generate Artificial Walrasian Equilibria. We…

Theoretical Economics · Economics 2026-03-20 Robert Day , Benjamin Lubin