English
Related papers

Related papers: Simultaneous 2nd Price Item Auctions with No-Under…

200 papers

Auto-bidding is now widely adopted as an interface between advertisers and internet advertising as it allows advertisers to specify high-level goals, such as maximizing value subject to a value-per-spend constraint. Prior research has…

Computer Science and Game Theory · Computer Science 2022-07-11 Christopher Liaw , Aranyak Mehta , Andres Perlroth

We expand the literature on the price of anarchy (PoA) of simultaneous item auctions by considering settings with correlated values; we do this via the fundamental economic model of interdependent values (IDV). It is well-known that in…

Computer Science and Game Theory · Computer Science 2021-03-02 Alon Eden , Michal Feldman , Inbal Talgam-Cohen , Ori Zviran

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

Motivated by recent research on combinatorial markets with endowed valuations by (Babaioff et al., EC 2018) and (Ezra et al., EC 2020), we introduce a notion of perturbation stability in Combinatorial Auctions (CAs) and study the extend to…

Computer Science and Game Theory · Computer Science 2023-09-06 Giannis Fikioris , Dimitris Fotakis

We study the efficiency of non-truthful auctions for auto-bidders with both return on spend (ROS) and budget constraints. The efficiency of a mechanism is measured by the price of anarchy (PoA), which is the worst case ratio between the…

Computer Science and Game Theory · Computer Science 2024-04-19 Christopher Liaw , Aranyak Mehta , Wennan Zhu

We study the efficiency of simple auctions in the presence of complements. [DMSW15] introduced the single-bid auction, and showed that it has a price of anarchy (PoA) of $O(\log m)$ for complement-free (i.e., subadditive) valuations. Prior…

Computer Science and Game Theory · Computer Science 2016-09-06 Michal Feldman , Ophir Friedler , Jamie Morgenstern , Guy Reiner

Auto-bidding is an area of increasing importance in the domain of online advertising. We study the problem of designing auctions in an auto-bidding setting with the goal of maximizing welfare at system equilibrium. Previous results showed…

Computer Science and Game Theory · Computer Science 2022-04-26 Aranyak Mehta

A standard result from auction theory is that bidding truthfully in a second price auction is a weakly dominant strategy. The result, however, does not apply in the presence of Cost Per Action (CPA) constraints. Such constraints exist, for…

Computer Science and Game Theory · Computer Science 2019-05-13 Benjamin Heymann

Incorporating budget constraints into the analysis of auctions has become increasingly important, as they model practical settings more accurately. The social welfare function, which is the standard measure of efficiency in auctions, is…

Computer Science and Game Theory · Computer Science 2015-11-05 Yossi Azar , Michal Feldman , Nick Gravin , Alan Roytman

We initiate the study of the social welfare loss caused by corrupt auctioneers, both in single-item and multi-unit auctions. In our model, the auctioneer may collude with the winning bidders by letting them lower their bids in exchange for…

Computer Science and Game Theory · Computer Science 2022-05-10 Andries van Beek , Ruben Brokkelkamp , Guido Schäfer

The declining price anomaly states that the price weakly decreases when multiple copies of an item are sold sequentially over time. The anomaly has been observed in a plethora of practical applications. On the theoretical side, Gale and…

Computer Science and Game Theory · Computer Science 2019-05-03 Vishnu V. Narayan , Enguerrand Prebet , Adrian Vetta

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 study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly…

Theoretical Economics · Economics 2022-02-16 Ethan Che

As is well known, many classes of markets have efficient equilibria, but this depends on agents being non-strategic, i.e. that they declare their true demands when offered goods at particular prices, or in other words, that they are…

Computer Science and Game Theory · Computer Science 2017-12-18 Richard Cole , Yixin Tao

We study the Price of Anarchy of simultaneous first-price auctions for buyers with submodular and subadditive valuations. The current best upper bounds for the Bayesian Price of Anarchy of these auctions are e/(e-1) [Syrgkanis and Tardos…

Computer Science and Game Theory · Computer Science 2015-08-06 George Christodoulou , Annamária Kovács , Alkmini Sgouritsa , Bo Tang

The rise of automated bidding strategies in online advertising presents new challenges in designing and analyzing efficient auction mechanisms. In this paper, we focus on proportional mechanisms within the context of auto-bidding and study…

Computer Science and Game Theory · Computer Science 2026-04-27 Nguyen Kim Thang

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

In most of microeconomic theory, consumers are assumed to exhibit decreasing marginal utilities. This paper considers combinatorial auctions among such submodular buyers. The valuations of such buyers are placed within a hierarchy of…

Computer Science and Game Theory · Computer Science 2007-05-23 Benny Lehmann , Daniel Lehmann , Noam Nisan

A line of recent work provides welfare guarantees of simple combinatorial auction formats, such as selling m items via simultaneous second price auctions (SiSPAs) (Christodoulou et al. 2008, Bhawalkar and Roughgarden 2011, Feldman et al.…

Computer Science and Game Theory · Computer Science 2016-04-07 Constantinos Daskalakis , Vasilis Syrgkanis

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…

Computer Science and Game Theory · Computer Science 2012-09-11 Zhiyi Huang , Nikhil R. Devanur , David Malec
‹ Prev 1 2 3 10 Next ›