English
Related papers

Related papers: An Improved Welfare Guarantee for First Price Auct…

200 papers

We examine the complexity of computing welfare- and revenue-maximizing equilibria in autobidding second-price auctions subject to return-on-spend (RoS) constraints. We show that computing an autobidding equilibrium that approximates the…

Computer Science and Game Theory · Computer Science 2026-02-11 Ioannis Anagnostides , Ian Gemp , Georgios Piliouras , Kelly Spendlove

We continue the study of the performance for fixed-price mechanisms in the bilateral trade problem, and improve approximation ratios of welfare-optimal mechanisms in several settings. Specifically, in the case where only the buyer…

Computer Science and Game Theory · Computer Science 2023-03-29 Zhengyang Liu , Zeyu Ren , Zihe Wang

We consider the problem of dividing a set of indivisible goods among agents with additive valuations. This problem has been studied under various objectives in both the computer science and the operations research literature. Our main…

Computer Science and Game Theory · Computer Science 2026-05-27 Vignesh Viswanathan

We study the efficiency of the proportional allocation mechanism, that is widely used to allocate divisible resources. Each agent submits a bid for each divisible resource and receives a fraction proportional to her bids. We quantify the…

Computer Science and Game Theory · Computer Science 2015-07-28 George Christodoulou , Alkmini Sgouritsa , Bo Tang

We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in…

Data Structures and Algorithms · Computer Science 2019-05-13 Bhaskar Chaudhury , Yun Kuen Cheung , Jugal Garg , Naveen Garg , Martin Hoefer , Kurt Mehlhorn

We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that each agent has i.i.d. values for the item across rounds, and…

Computer Science and Game Theory · Computer Science 2025-11-07 David X. Lin , Siddhartha Banerjee , Giannis Fikioris , Éva Tardos

In a combinatorial auction with item bidding, agents participate in multiple single-item second-price auctions at once. As some items might be substitutes, agents need to strategize in order to maximize their utilities. A number of results…

Computer Science and Game Theory · Computer Science 2017-04-17 Paul Dütting , Thomas Kesselheim

Computational and economic results suggest that social welfare maximization and combinatorial auction design are much easier when bidders' valuations satisfy the "gross substitutes" condition. The goal of this paper is to evaluate…

Computer Science and Game Theory · Computer Science 2016-08-09 Tim Roughgarden , Inbal Talgam-Cohen , Jan Vondrák

In settings where players have a limited access to liquidity, represented in the form of budget constraints, efficiency maximization has proven to be a challenging goal. In particular, the social welfare cannot be approximated by a better…

Computer Science and Game Theory · Computer Science 2013-04-29 Shahar Dobzinski , Renato Paes Leme

We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the…

Computer Science and Game Theory · Computer Science 2008-10-20 Krzysztof R. Apt , Vangelis Markakis

Our paper concerns the computation of Nash equilibria of first-price auctions with correlated values. While there exist several equilibrium computation methods for auctions with independent values, the correlation of the bidders' values…

Computer Science and Game Theory · Computer Science 2021-08-11 Benjamin Heymann , Panayotis Mertikopoulos

In many first-price auctions, bidders face considerable strategic uncertainty: They cannot perfectly anticipate the other bidders' bidding behavior. We propose a model in which bidders do not know the entire distribution of opponent bids…

Theoretical Economics · Economics 2022-03-30 Bernhard Kasberger

We give the first $O(1)$-approximation for the weighted Nash Social Welfare problem with additive valuations. The approximation ratio we obtain is $e^{1/e} + \epsilon \approx 1.445 + \epsilon$, which matches the best known approximation…

Computer Science and Game Theory · Computer Science 2025-08-20 Yuda Feng , Shi Li

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

We study the price of anarchy of the first-price auction in the autobidding world, where bidders can be either utility maximizers (i.e., traditional bidders) or value maximizers (i.e., autobidders). We show that with autobidders only, the…

Computer Science and Game Theory · Computer Science 2022-08-24 Yuan Deng , Jieming Mao , Vahab Mirrokni , Hanrui Zhang , Song Zuo

In many natural settings agents participate in multiple different auctions that are not simultaneous. In such auctions, future opportunities affect strategic considerations of the players. The goal of this paper is to develop a quantitative…

Computer Science and Game Theory · Computer Science 2012-06-22 Vasilis Syrgkanis , Eva Tardos

We study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

Computer Science and Game Theory · Computer Science 2024-04-17 Shahar Dobzinski , Ariel Shaulker

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

We introduce a strategic behavior in reinsurance bilateral transactions, where agents choose the risk preferences they will appear to have in the transaction. Within a wide class of risk measures, we identify agents' strategic choices to a…

Risk Management · Quantitative Finance 2020-03-19 Michail Anthropelos , Tim J. Boonen

We study the problem of allocating a set of indivisible goods among agents with subadditive valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most compelling notion of fairness in the context of…

Computer Science and Game Theory · Computer Science 2020-08-18 Bhaskar Ray Chaudhury , Jugal Garg , Ruta Mehta