More Like this

1. From Resource Auction to Service Auction: An Auction Paradigm Shift in Wireless Networks

   https://doi.org/10.1109/MWC.005.2100627  

   Chen, Xianhao ; Deng, Yiqin ; Zhu, Guangyu ; Wang, Danxin ; Fang, Yuguang ( April 2022 , IEEE Wireless Communications)
2. Certifying Strategyproof Auction Networks

   Curry, Michael ; Chiang, Ping-Yeh ; Goldstein, Tom ; Dickerson, John ( December 2020 , Advances in neural information processing systems)

   null (Ed.)
3. Estimation of Standard Auction Models

   https://doi.org/10.1145/3490486.3538284  

   Cherapanamjeri, Yeshwanth ; Daskalakis, Constantinos ; Ilyas, Andrew ; Zampetakis, Manolis ( January 2022 , 23rd ACM Conference on Economics and Computation)
4. Optimal Auction Design with Malicious Sellers

   Brahma, Swastik ; Njilla, Laurent ; Nan, Satyaki ( January 2022 , Workshop on Security, Privacy and Trust in the Internet of Things (PerCom SPT-IoT))
5. Pacing Equilibrium in First Price Auction Markets

   https://doi.org/10.1287/mnsc.2022.4310  

   Conitzer, Vincent ; Kroer, Christian ; Panigrahi, Debmalya ; Schrijvers, Okke ; Stier-Moses, Nicolas E. ; Sodomka, Eric ; Wilkens, Christopher A. ( December 2022 , Management Science)

   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 advertisers. On such platforms, advertisers often participate in auctions through a proxy bidder, so the standard incentive analyses that are common in the literature do not apply directly. In this paper, we take the perspective of a budget management system that surfaces aggregated incentives—instead of individual auctions—and compare first and second price auctions. We show that theory offers surprising endorsement for using a first price auction to sell individual impressions. In particular, first price auctions guarantee uniqueness of the steady-state equilibrium of the budget management system, monotonicity, and other desirable properties, as well as efficient computation through the solution to the well-studied Eisenberg–Gale convex program. Contrary to what one can expect from first price auctions, we show that incentives issues are not a barrier that undermines the system. Using realistic instances generated from data collected at real-world auction platforms, we show that bidders have small regret with respect to their optimal ex post strategy, and they do not have a big incentive to misreport when they can influence equilibria directly by giving inputs strategically. Finally, budget-constrained bidders, who have significant prevalence in real-world platforms, tend to have smaller regrets. Our computations indicate that bidder budgets, pacing multipliers, and regrets all have a positive association in statistical terms. This paper was accepted by Gabriel Weintraub, revenue management and market analytics. Funding: D. Panigrahi was supported in part by the National Science Foundation [Awards CCF 1535972, CCF 1750140, and CCF 1955703]. Supplemental Material: The data files are available at https://doi.org/10.1287/mnsc.2022.4310 . 

   more » « less