English
Related papers

Related papers: Welfare and Rationality Guarantees for the Simulta…

200 papers

One of the Multi-Agent Systems that is widely used by various government agencies, buyers and sellers in a market economy, in such a manner so as to attain optimized resource allocation, is the Combinatorial Auctioning System (CAS). We…

Computer Science and Game Theory · Computer Science 2010-05-30 Megha Saini , Shrisha Rao

We study algorithms for combinatorial market design problems, where a set of heterogeneous and indivisible objects are priced and sold to potential buyers subject to equilibrium constraints. Extending the CWE notion introduced by Feldman et…

Computer Science and Game Theory · Computer Science 2014-01-20 Michal Feldman , Brendan Lucier

We develop a unified ascending-auction framework for computing Walrasian equilibria in combinatorial markets with strong substitutes valuations and piecewise-linear payment functions. Our auction extends the celebrated ascending auctions of…

Computer Science and Game Theory · Computer Science 2026-04-14 Taihei Oki , Ryosuke Sato

Multi-Robot Task Allocation (MRTA) is a central challenge in decentralized multi-agent systems, where teams of robots must cooperatively assign and execute tasks under limited communication while optimizing global performance objectives.…

Robotics · Computer Science 2026-05-22 Jose Rodriguez , Constantine Tarawneh , Sven Koenig , Wenjie Dong , Qi Lu

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

We present a general framework for designing approximately revenue-optimal mechanisms for multi-item additive auctions, which applies to both truthful and non-truthful auctions. Given a (not necessarily truthful) single-item auction format…

Computer Science and Game Theory · Computer Science 2022-09-23 Constantinos Daskalakis , Maxwell Fishelson , Brendan Lucier , Vasilis Syrgkanis , Santhoshini Velusamy

With spectrum auctions as our prime motivation, in this paper we analyze combinatorial auctions where agents' valuations exhibit complementarities. Assuming that the agents only value bundles of size at most $k$ and also assuming that we…

Computer Science and Game Theory · Computer Science 2016-06-07 Dengwang Tang , Vijay Subramanian

Consider the the problem of maximizing the relative social welfare of truthful single-winner voting schemes with cardinal preferences compared to the classical range voting scheme. The range voting scheme is a simple and straightforward…

Computer Science and Game Theory · Computer Science 2019-04-02 Sinya Lee

Iterative combinatorial auctions are widely used in high stakes settings such as spectrum auctions. Such auctions can be hard to analyze, making it difficult for bidders to determine how to behave and for designers to optimize auction rules…

Computer Science and Game Theory · Computer Science 2024-07-25 Greg d'Eon , Neil Newman , Kevin Leyton-Brown

A combinatorial market consists of a set of indivisible items and a set of agents, where each agent has a valuation function that specifies for each subset of items its value for the given agent. From an optimization point of view, the goal…

Computer Science and Game Theory · Computer Science 2023-01-05 Kristóf Bérczi , Laura Codazzi , Julian Golak , Alexander Grigoriev

In this work, we study spectrum auction problem where each request from secondary users has spatial, temporal, and spectral features. With the requests of secondary users and the reserve price of the primary user, our goal is to design…

Networking and Internet Architecture · Computer Science 2013-05-29 Yu-e Sun , He Huang , Xiang-Yang Li , Zhili Chen , Wei Yang , Hongli Xu , Liusheng Huang

We study the problem of achieving high efficiency in iterative combinatorial auctions (ICAs). ICAs are a kind of combinatorial auction where the auctioneer interacts with bidders to gather their valuation information using a limited number…

Computer Science and Game Theory · Computer Science 2024-09-24 Ryota Maruo , Hisashi Kashima

We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as…

Computer Science and Game Theory · Computer Science 2014-09-12 Aris Filos-Ratsikas , Peter Bro Miltersen

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 the necessity of interaction for obtaining efficient allocations in subadditive combinatorial auctions. This problem was originally introduced by Dobzinski, Nisan, and Oren (STOC'14) as the following simple market scenario: $m$…

Computer Science and Game Theory · Computer Science 2017-05-05 Sepehr Assadi

We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the…

Computer Science and Game Theory · Computer Science 2018-01-16 Yiannis Giannakopoulos , Elias Koutsoupias

We study the communication complexity of welfare maximization in combinatorial auctions with bidders from either a standard valuation class (which require exponential communication to explicitly state, such as subadditive or XOS), or…

Computer Science and Game Theory · Computer Science 2025-12-09 Frederick V. Qiu , S. Matthew Weinberg , Qianfan Zhang

In various markets where sellers compete in price, price oscillations are observed rather than convergence to equilibrium. Such fluctuations have been empirically observed in the retail market for gasoline, in airline pricing and in the…

Computer Science and Game Theory · Computer Science 2015-04-28 Moshe Babaioff , Renato Paes Leme , Balasubramanian Sivan

This paper proposes a doubled-sided auction mechanism with price discrimination for social welfare (SW) maximization in the electricity and heating market. In this mechanism, energy service providers (ESPs) submit offers and load…

Computer Science and Game Theory · Computer Science 2022-05-31 Lu Wang , Wei Gu , Shuai Lu , Haifeng Qiu , Zhi Wu

Sponsored search auctions are commonly modeled as an assignment of a fixed set of slots (positions) to a set of advertisers, with welfare maximization being reducible to a standard matching problem. Motivated by modern ad formats, we study…

Computer Science and Game Theory · Computer Science 2026-05-13 Eleni Batziou , Georgios Birmpas , Georgios Chionas , Piotr Krysta