English
Related papers

Related papers: Heavy Tails Make Happy Buyers

200 papers

We study autobidding ad auctions with user costs, where each bidder is value-maximizing subject to a return-over-investment (ROI) constraint, and the seller aims to maximize the social welfare taking into consideration the user's cost of…

Computer Science and Game Theory · Computer Science 2023-02-02 Yuan Deng , Jieming Mao , Vahab Mirrokni , Hanrui Zhang , Song Zuo

We study revenue optimization in a repeated auction between a single seller and a single buyer. Traditionally, the design of repeated auctions requires strong modeling assumptions about the bidder behavior, such as it being myopic, infinite…

Computer Science and Game Theory · Computer Science 2019-03-12 Shipra Agrawal , Constantinos Daskalakis , Vahab Mirrokni , Balasubramanian Sivan

We focus on online second price auctions, where bids are made sequentially, and the winning bidder pays the maximum of the second-highest bid and a seller specified starting price. For many such auctions, the seller does not see all the…

Methodology · Statistics 2026-02-23 Sourav Mukherjee , Ziqian Yang , Rohit K Patra , Kshitij Khare

We study reserve prices in auctions with independent private values when bidders are expectations-based loss averse. We find that the optimal public reserve price excludes fewer bidder types than under risk neutrality. Moreover, we show…

Theoretical Economics · Economics 2023-06-16 Benjamin Balzer , Antonio Rosato

Different questions related with analysis of extreme values and outliers arise frequently in practice. To exclude extremal observations and outliers is not a good decision because they contain important information about the observed…

Methodology · Statistics 2018-01-17 Pavlina K. Jordanova , Monika P. Petkova

Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange, the exchange ``calls out'' to…

Computer Science and Game Theory · Computer Science 2015-03-13 Tanmoy Chakraborty , Eyal Even-Dar , Sudipto Guha , Yishay Mansour , S. Muthukrishnan

We use bias-reduced estimators of high quantiles, of heavy-tailed distributions, to introduce a new estimator of the mean in the case of infinite second moment. The asymptotic normality of the proposed estimator is established and checked,…

Methodology · Statistics 2014-05-09 Brahim Brahimi , Djamel Meraghni , Abdelhakim Necir , Djabrane Yahia

Simultaneous item auctions are simple procedures for allocating items to bidders with potentially complex preferences over different item sets. In a simultaneous auction, every bidder submits bids on all items simultaneously. The allocation…

Computer Science and Game Theory · Computer Science 2012-09-24 Michal Feldman , Hu Fu , Nick Gravin , Brendan Lucier

Since 2019, most ad exchanges and sell-side platforms (SSPs), in the online advertising industry, shifted from second to first price auctions. Due to the fundamental difference between these auctions, demand-side platforms (DSPs) have had…

In quasi-proportional auctions, each bidder receives a fraction of the allocation equal to the weight of their bid divided by the sum of weights of all bids, where each bid's weight is determined by a weight function. We study the…

Computer Science and Game Theory · Computer Science 2015-07-28 Zheng Wen , Eric Bax , James Li

Recent spectrum auctions in the United Kingdom, and some proposals for future auctions of spectrum in the United States, are based on preliminary price discovery rounds, followed by calculation of final prices for the winning buyers. For…

Computer Science and Game Theory · Computer Science 2012-09-12 Vineet Abhishek , Bruce Hajek

Real-world visual data often exhibits a long-tailed distribution, where some ''head'' classes have a large number of samples, yet only a few samples are available for ''tail'' classes. Such imbalanced distribution causes a great challenge…

Computer Vision and Pattern Recognition · Computer Science 2020-03-11 Junjie Zhang , Lingqiao Liu , Peng Wang , Chunhua Shen

We consider the problem of the optimization of bidding strategies in prior-dependent revenue-maximizing auctions, when the seller fixes the reserve prices based on the bid distributions. Our study is done in the setting where one bidder is…

Computer Science and Game Theory · Computer Science 2019-05-15 Thomas Nedelec , Noureddine El Karoui , Vianney Perchet

For purposes of Value-at-Risk estimation, we consider several multivariate families of heavy-tailed distributions, which can be seen as multidimensional versions of Paretian stable and Student's t distributions allowing different marginals…

Risk Management · Quantitative Finance 2011-12-20 Carlo Marinelli , Stefano d'Addona , Svetlozar T. Rachev

Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful, it is discarded and replaced. For simple models, the…

Adaptation and Self-Organizing Systems · Physics 2009-11-07 R. D'Hulst , G. J. Rodgers

Internet search results are a growing and highly profitable advertising platform. Search providers auction advertising slots to advertisers on their search result pages. Due to the high volume of searches and the users' low tolerance for…

Databases · Computer Science 2016-11-17 David J. Martin , Johannes Gehrke , Joseph Y. Halpern

Heavy tailed phenomena are naturally analyzed by extreme value statistics. A crucial step in such an analysis is the estimation of the extreme value index, which describes the tail heaviness of the underlying probability distribution. We…

Statistics Theory · Mathematics 2018-07-18 Hanan Ahmed , John H. J. Einmahl

Currently, over 90% of Ethereum blocks are built using MEV-Boost, an auction that allows validators to sell their block-building power to builders who compete in an open English auction in each slot. Shortly after the merge, when MEV-Boost…

Theoretical Economics · Economics 2023-11-16 Mallesh Pai , Max Resnick

The classic result of Bulow and Klemperer (1996) shows that in multi-unit auctions with $m$ units and $n\geq m$ buyers whose values are sampled i.i.d. from a regular distribution, the revenue of the VCG auction with $m$ additional buyers is…

Computer Science and Game Theory · Computer Science 2026-02-13 Moshe Babaioff , Yiding Feng , Zihan Luo

Budget constraints are ubiquitous in online advertisement auctions. To manage these constraints and smooth out the expenditure across auctions, the bidders (or the platform on behalf of them) often employ pacing: each bidder is assigned a…

Computer Science and Game Theory · Computer Science 2023-02-07 Xi Chen , Christian Kroer , Rachitesh Kumar