English
Related papers

Related papers: Pacing Equilibria in Second-Price Auctions with Fe…

200 papers

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

This paper studies equilibrium quality of semi-separable position auctions (known as the Ad Types setting) with greedy or optimal allocation combined with generalized second-price (GSP) or Vickrey-Clarke-Groves (VCG) pricing. We make three…

Computer Science and Game Theory · Computer Science 2021-03-11 Hadi Elzayn , Riccardo Colini-Baldeschi , Brian Lan , Okke Schrijvers

We provide efficient estimation methods for first- and second-price auctions under independent (asymmetric) private values and partial observability. Given a finite set of observations, each comprising the identity of the winner and the…

Computer Science and Game Theory · Computer Science 2022-05-05 Yeshwanth Cherapanamjeri , Constantinos Daskalakis , Andrew Ilyas , Manolis Zampetakis

We design algorithms for computing approximately revenue-maximizing {\em sequential posted-pricing mechanisms (SPM)} in $K$-unit auctions, in a standard Bayesian model. A seller has $K$ copies of an item to sell, and there are $n$ buyers,…

Computer Science and Game Theory · Computer Science 2010-08-11 Tanmoy Chakraborty , Eyal Even-Dar , Sudipto Guha , Yishay Mansour , S. Muthukrishnan

This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in discounted repeated games. The process starts with a single hypercube approximation of the set of SPE. Then the initial…

Computer Science and Game Theory · Computer Science 2010-02-10 Andriy Burkov , Brahim Chaib-draa

Traditional methods for computing equilibria in auctions become computationally intractable as auction complexity increases, particularly in multi-item and dynamic auctions. This paper introduces a self-play based reinforcement learning…

General Economics · Economics 2024-10-21 Pranjal Rawat

We initiate the study of statistical inference and A/B testing for two market equilibrium models: linear Fisher market (LFM) equilibrium and first-price pacing equilibrium (FPPE). LFM arises from fair resource allocation systems such as…

Computer Science and Game Theory · Computer Science 2025-03-10 Luofeng Liao , Christian Kroer

In online ad markets, a rising number of advertisers are employing bidding agencies to participate in ad auctions. These agencies are specialized in designing online algorithms and bidding on behalf of their clients. Typically, an agency…

Computer Science and Game Theory · Computer Science 2023-06-14 Yurong Chen , Qian Wang , Zhijian Duan , Haoran Sun , Zhaohua Chen , Xiang Yan , Xiaotie Deng

We study the aggregate welfare and individual regret guarantees of dynamic \emph{pacing algorithms} in the context of repeated auctions with budgets. Such algorithms are commonly used as bidding agents in Internet advertising platforms,…

Computer Science and Game Theory · Computer Science 2026-01-06 Jason Gaitonde , Yingkai Li , Bar Light , Brendan Lucier , Aleksandrs Slivkins

In this paper, we introduce a novel, non-recursive, maximal matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. It differs from the usual equilibrium matching, which clears a market at the…

Computer Science and Game Theory · Computer Science 2013-04-12 Jinzhong Niu , Simon Parsons

Auctions are modeled as Bayesian games with continuous type and action spaces. Determining equilibria in auction games is computationally hard in general and no exact solution theory is known. We introduce an algorithmic framework in which…

Computer Science and Game Theory · Computer Science 2023-05-10 Martin Bichler , Maximilian Fichtl , Matthias Oberlechner

Equilibrium problems in Bayesian auction games can be described as systems of differential equations. Depending on the model assumptions, these equations might be such that we do not have a rigorous mathematical solution theory. The lack of…

Computer Science and Game Theory · Computer Science 2024-12-18 Martin Bichler , Stephan B. Lunowa , Matthias Oberlechner , Fabian R. Pieroth , Barbara Wohlmuth

Applications of combinatorial auctions (CA) as market mechanisms are prevalent in practice, yet their Bayesian Nash equilibria (BNE) remain poorly understood. Analytical solutions are known only for a few cases where the problem can be…

Computer Science and Game Theory · Computer Science 2021-02-09 Stefan Heidekrüger , Paul Sutterer , Nils Kohring , Maximilian Fichtl , Martin Bichler

We present a methodology to robustly estimate the competitive equilibria (CE) of combinatorial markets under the assumption that buyers do not know their precise valuations for bundles of goods, but instead can only provide noisy estimates.…

Computer Science and Game Theory · Computer Science 2021-01-26 Enrique Areyan Viqueira , Cyrus Cousins , Amy Greenwald

After experimentation with other designs, the major search engines converged on the weighted, generalized second-price auction (wGSP) for selling keyword advertisements. Notably, this convergence occurred before position auctions were well…

Computer Science and Game Theory · Computer Science 2014-08-05 David R. M Thompson , Kevin Leyton-Brown

This paper develops algorithms to solve strong-substitutes product-mix auctions. That is, it finds competitive equilibrium prices and quantities for agents who use this auction's bidding language to truthfully express their…

Computer Science and Game Theory · Computer Science 2023-07-11 Elizabeth Baldwin , Paul W. Goldberg , Paul Klemperer , Edwin Lock

Mature internet advertising platforms offer high-level campaign management tools to help advertisers run their campaigns, often abstracting away the intricacies of how each ad is placed and focusing on aggregate metrics of interest to…

Computer Science and Game Theory · Computer Science 2021-09-07 Vincent Conitzer , Christian Kroer , Debmalya Panigrahi , Okke Schrijvers , Eric Sodomka , Nicolas E. Stier-Moses , Chris Wilkens

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

We present the first analysis of Fisher markets with buyers that have budget-additive utility functions. Budget-additive utilities are elementary concave functions with numerous applications in online adword markets and revenue optimization…

Computer Science and Game Theory · Computer Science 2016-05-03 Xiaohui Bei , Jugal Garg , Martin Hoefer , Kurt Mehlhorn

We consider the problem of allocating indivisible goods in a way that is fair, using one of the leading market mechanisms in economics: the competitive equilibrium from equal incomes. Focusing on two major classes of valuations, namely…

Computer Science and Game Theory · Computer Science 2016-07-19 Simina Brânzei , Hadi Hosseini , Peter Bro Miltersen