English
Related papers

Related papers: Welfare and Rationality Guarantees for the Simulta…

200 papers

We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting rationally and strategically in order to maximize utility. Our…

Computer Science and Game Theory · Computer Science 2021-06-01 Alexander Braun , Thomas Kesselheim

Budget-feasible procurement auctions play a pivotal role in various AI-driven marketplaces, such as data acquisition and crowdsourcing, where a buyer with a limited budget seeks to procure services from strategic sellers with private costs.…

Computer Science and Game Theory · Computer Science 2026-05-04 Shuang Cui , He Huang , Yu-e Sun , Chen Xue

We study the design of iterative combinatorial auctions (ICAs). The main challenge in this domain is that the bundle space grows exponentially in the number of items. To address this, several papers have recently proposed machine learning…

Computer Science and Game Theory · Computer Science 2024-03-29 Ermis Soumalias , Jakob Weissteiner , Jakob Heiss , Sven Seuken

Simple Clock Auctions (SCA) are a mechanism commonly used in spectrum auctions to sell lots of frequency bandwidths. We study such an auction with one player having access to perfect information against straightforward bidders. When the…

Computer Science and Game Theory · Computer Science 2025-12-12 Jad Zeroual , Marianne Akian , Aurélien Bechler , Matthieu Chardy , Stéphane Gaubert

In this paper, we study the problem of maximizing social welfare in combinatorial markets through pricing schemes. We consider the existence of prices that are capable to achieve optimal social welfare without a central tie-breaking…

Computer Science and Game Theory · Computer Science 2020-07-20 Kristóf Bérczi , Naonori Kakimura , Yusuke Kobayashi

This paper analyzes individually-rational ex post equilibrium in the VC (Vickrey-Clarke) combinatorial auctions. If $\Sigma$ is a family of bundles of goods, the organizer may restrict the participants by requiring them to submit their bids…

Computer Science and Game Theory · Computer Science 2007-05-23 Ron Holzman , Noa Kfir-Dahav , Dov Monderer , Moshe Tennenholtz

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

Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…

Computer Science and Game Theory · Computer Science 2017-10-10 Simina Brânzei , Aris Filos-Ratsikas , Peter Bro Miltersen , Yulong Zeng

When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two…

Computer Science and Game Theory · Computer Science 2012-05-15 Ilias Diakonikolas , Christos Papadimitriou , George Pierrakos , Yaron Singer

We study incentive compatible mechanisms for Combinatorial Auctions where the bidders have submodular (or XOS) valuations and are budget-constrained. Our objective is to maximize the \emph{liquid welfare}, a notion of efficiency for…

Computer Science and Game Theory · Computer Science 2018-12-14 Dimitris Fotakis , Kyriakos Lotidis , Chara Podimata

We study social welfare of learning outcomes in mechanisms with admission. In our repeated game there are $n$ bidders and $m$ mechanisms, and in each round each mechanism is available for each bidder only with a certain probability. Our…

Computer Science and Game Theory · Computer Science 2016-10-18 Martin Hoefer , Thomas Kesselheim , Bojana Kodric

Algorithmic Mechanism Design attempts to marry computation and incentives, mainly by leveraging monetary transfers between designer and selfish agents involved. This is principally because in absence of money, very little can be done to…

Computer Science and Game Theory · Computer Science 2013-10-02 Dimitris Fotakis , Piotr Krysta , Carmine Ventre

We study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the…

Computer Science and Game Theory · Computer Science 2015-06-10 Shahar Dobzinski , Hu Fu , Robert Kleinberg

We study revenue maximization in multi-item auctions, where bidders have subadditive valuations over independent items. Providing a simple mechanism that is approximately revenue-optimal in this setting is a major open problem in mechanism…

Computer Science and Game Theory · Computer Science 2023-10-13 Yang Cai , Ziyun Chen , Jinzhao Wu

We study combinatorial auctions with interdependent valuations. In such settings, each agent $i$ has a private signal $s_i$ that captures her private information, and the valuation function of every agent depends on the entire signal…

Computer Science and Game Theory · Computer Science 2019-06-04 Alon Eden , Michal Feldman , Amos Fiat , Kira Goldner , Anna R. Karlin

We study the communication complexity of dominant strategy implementations of combinatorial auctions. We start with two domains that are generally considered "easy": multi-unit auctions with decreasing marginal values and combinatorial…

Computer Science and Game Theory · Computer Science 2022-06-02 Shahar Dobzinski , Shiri Ron , Jan Vondrák

Civic Crowdfunding (CC) uses the ``power of the crowd'' to garner contributions towards public projects. As these projects are non-excludable, agents may prefer to ``free-ride,'' resulting in the project not being funded. For single project…

Computer Science and Game Theory · Computer Science 2022-11-28 Sankarshan Damle , Manisha Padala , Sujit Gujar

In many settings agents participate in multiple different auctions that are not necessarily implemented simultaneously. Future opportunities affect strategic considerations of the players in each auction, introducing externalities.…

Computer Science and Game Theory · Computer Science 2011-12-30 Renato Paes Leme , Vasilis Syrgkanis , Eva Tardos

Internet ad auctions have evolved from a few lines of text to richer informational layouts that include images, sitelinks, videos, etc. Ads in these new formats occupy varying amounts of space, and an advertiser can provide multiple…

Computer Science and Game Theory · Computer Science 2022-06-08 Gagan Aggarwal , Kshipra Bhawalkar , Aranyak Mehta , Divyarthi Mohan , Alexandros Psomas

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