English
Related papers

Related papers: Computing Perfect Bayesian Equilibria in Sequentia…

200 papers

We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient…

Computer Science and Game Theory · Computer Science 2013-06-20 Evangelos Markakis , Orestis Telelis

We model a procurement scenario in which two \textit{imperfect} bidders act simultaneously on behalf of a single buyer, a configuration common in display advertising and referred to as \textit{side-by-side bidding} but largely unexplored in…

Computer Science and Game Theory · Computer Science 2025-12-05 Benjamin Heymann

Online auctions are one of the most fundamental facets of the modern economy and power an industry generating hundreds of billions of dollars a year in revenue. Auction theory has historically focused on the question of designing the best…

Computer Science and Game Theory · Computer Science 2021-09-23 Thomas Nedelec , Clément Calauzènes , Noureddine El Karoui , Vianney Perchet

This survey outlines a general and modular theory for proving approximation guarantees for equilibria of auctions in complex settings. This theory complements traditional economic techniques, which generally focus on exact and optimal…

Computer Science and Game Theory · Computer Science 2016-07-27 Tim Roughgarden , Vasilis Syrgkanis , Eva Tardos

Budgets play a significant role in real-world sequential auction markets such as those implemented by internet companies. To maximize the value provided to auction participants, spending is smoothed across auctions so budgets are used for…

Computer Science and Game Theory · Computer Science 2021-05-11 Vincent Conitzer , Christian Kroer , Eric Sodomka , Nicolas E. Stier-Moses

We present a novel coalgebraic formulation of infinite extensive games. We define both the game trees and the strategy profiles by possibly infinite systems of corecursive equations. Certain strategy profiles are proved to be subgame…

Computer Science and Game Theory · Computer Science 2015-07-29 Samson Abramsky , Viktor Winschel

We consider finite-horizon and infinite-horizon versions of a dynamic game with $N$ selfish players who observe their types privately and take actions that are publicly observed. Players' types evolve as conditionally independent Markov…

Optimization and Control · Mathematics 2018-03-20 Deepanshu Vasal , Abhinav Sinha , Achilleas Anastasopoulos

The sequential equilibrium is a standard solution concept for extensive-form games with imperfect information that includes an explicit representation of the players' beliefs. An assessment consisting of a strategy and a belief is a…

Computer Science and Game Theory · Computer Science 2024-02-08 Moritz Graf , Thorsten Engesser , Bernhard Nebel

We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…

Theoretical Economics · Economics 2024-11-14 Simon Finster , Patrick Loiseau , Simon Mauras , Mathieu Molina , Bary Pradelski

We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the…

Computer Science and Game Theory · Computer Science 2018-01-16 Yiannis Giannakopoulos , Elias Koutsoupias

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 non-truthful auctions, agents' utility for a strategy depends on the strategies of the opponents and also the prior distribution over their private types; the set of Bayes Nash equilibria generally has an intricate dependence on the…

Computer Science and Game Theory · Computer Science 2022-11-02 Hu Fu , Tao Lin

We study the Bayesian coarse correlated equilibrium (BCCE) of continuous and discretised first-price and all-pay auctions under the standard symmetric independent private-values model. Our study is motivated by the question of how the…

Computer Science and Game Theory · Computer Science 2024-11-19 Mete Şeref Ahunbay , Martin Bichler

In online advertising, search engines sell ad placements for keywords continuously through auctions. This problem can be seen as an infinitely repeated game since the auction is executed whenever a user performs a query with the keyword. As…

Computer Science and Game Theory · Computer Science 2022-01-25 Francesco Belardinelli , Wojtek Jamroga , Vadim Malvone , Munyque Mittelmann , Aniello Murano , Laurent Perrussel

Developing efficient sequential bidding strategies for repeated auctions is an important practical challenge in various marketing tasks. In this setting, the bidding agent obtains information, on both the value of the item at sale and the…

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

The recent online platforms propose multiple items for bidding. The state of the art, however, is limited to the analysis of one item auction without resubmission. In this paper we study multi-item lowest unique bid auctions (LUBA) with…

Computer Science and Game Theory · Computer Science 2017-03-01 Yida Xu , Hamidou Tembine

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 problem of designing optimal auctions under restrictions on the set of permissible allocations. In addition to allowing us to restrict to deterministic mechanisms, we can also indirectly model non-additive valuations. We prove…

Computer Science and Game Theory · Computer Science 2016-06-07 Ian Kash , Rafael Frongillo

Bayesian optimization is a coherent, ubiquitous approach to decision-making under uncertainty, with applications including multi-arm bandits, active learning, and black-box optimization. Bayesian optimization selects decisions (i.e.…

Machine Learning · Computer Science 2023-12-13 Samuel Stanton , Wesley Maddox , Andrew Gordon Wilson

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