English
Related papers

Related papers: Prices, Bids, Values: One ML-Powered Combinatorial…

200 papers

We present a machine learning-powered iterative combinatorial auction (MLCA). The main goal of integrating machine learning (ML) into the auction is to improve preference elicitation, which is a major challenge in large combinatorial…

Computer Science and Game Theory · Computer Science 2021-09-03 Gianluca Brero , Benjamin Lubin , Sven Seuken

Preference elicitation is a major challenge in large combinatorial auctions because the bundle space grows exponentially in the number of items. Recent work has used machine learning (ML) algorithms to identify a small set of bundles to…

Computer Science and Game Theory · Computer Science 2025-05-23 Benjamin Lubin , Manuel Beyeler , Gianluca Brero , Sven Seuken

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

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

Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. However, expressing one's preferences can require bidding on all…

Computer Science and Game Theory · Computer Science 2007-05-23 Benoit Hudson , Tuomas Sandholm

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

We study the combinatorial assignment domain, which includes combinatorial auctions and course allocation. The main challenge in this domain is that the bundle space grows exponentially in the number of items. To address this, several…

Machine Learning · Computer Science 2023-03-14 Jakob Weissteiner , Jakob Heiss , Julien Siems , Sven Seuken

Many important resource allocation problems involve the combinatorial assignment of items, e.g., auctions or course allocation. Because the bundle space grows exponentially in the number of items, preference elicitation is a key challenge…

Computer Science and Game Theory · Computer Science 2023-03-14 Jakob Weissteiner , Jakob Heiss , Julien Siems , Sven Seuken

Recent advances in Fourier analysis have brought new tools to efficiently represent and learn set functions. In this paper, we bring the power of Fourier analysis to the design of combinatorial auctions (CAs). The key idea is to approximate…

Computer Science and Game Theory · Computer Science 2023-03-14 Jakob Weissteiner , Chris Wendler , Sven Seuken , Ben Lubin , Markus Püschel

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

In a sequential auction with multiple bidding agents, it is highly challenging to determine the ordering of the items to sell in order to maximize the revenue due to the fact that the autonomy and private information of the agents heavily…

Artificial Intelligence · Computer Science 2018-10-16 Sicco Verwer , Yingqian Zhang , Qing Chuan Ye

We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class,…

Computer Science and Game Theory · Computer Science 2016-06-01 Jacob Abernethy , Sébastien Lahaie , Matus Telgarsky

We study the potential of large language models (LLMs) as proxies for humans to simplify preference elicitation (PE) in combinatorial assignment. While traditional PE methods rely on iterative queries to capture preferences, LLMs offer a…

Artificial Intelligence · Computer Science 2025-02-17 Ermis Soumalias , Yanchen Jiang , Kehang Zhu , Michael Curry , Sven Seuken , David C. Parkes

Auction has been used to allocate resources or tasks to processes, machines or other autonomous entities in distributed systems. When different bidders have different demands and valuations on different types of resources or tasks, the…

Computer Science and Game Theory · Computer Science 2019-02-26 Li-Hsing Yen , Guang-Hong Sun

We study a general online combinatorial auction problem in algorithmic mechanism design. A provider allocates multiple types of capacity-limited resources to customers that arrive in a sequential and arbitrary manner. Each customer has a…

Computer Science and Game Theory · Computer Science 2023-10-10 Xiaoqi Tan , Alberto Leon-Garcia , Yuan Wu , Danny H. K. Tsang

Iterative combinatorial auctions (CAs) are often used in multi-billion dollar domains like spectrum auctions, and speed of convergence is one of the crucial factors behind the choice of a specific design for practical applications. To…

Computer Science and Game Theory · Computer Science 2019-07-12 Gianluca Brero , Sébastien Lahaie , Sven Seuken

In cloud investment markets, consumers are looking for the lowest cost and a desirable fairness while providers are looking for strategies to achieve the highest possible profit and return. Most existing models for auction-based resource…

Computer Science and Game Theory · Computer Science 2016-09-22 Reihaneh Hassanzadeh , Ali Movaghar , Hamid Reza Hassanzadeh

Bidders in combinatorial auctions face significant challenges when describing their preferences to an auctioneer. Classical work on preference elicitation focuses on query-based techniques inspired from proper learning--often via proxies…

Computer Science and Game Theory · Computer Science 2025-12-23 David Huang , Francisco Marmolejo-Cossío , Edwin Lock , David Parkes

As distributed energy resources (DERs) proliferate, future power system will need new market platforms enabling prosumers to trade various electricity and grid-support products. However, prosumers often exhibit complex, product…

Systems and Control · Electrical Eng. & Systems 2026-03-12 Shobhit Singhal , Lesia Mitridati

We investigate auction mechanisms for AI-generated content, focusing on applications like ad creative generation. In our model, agents' preferences over stochastically generated content are encoded as large language models (LLMs). We…

Computer Science and Game Theory · Computer Science 2024-07-03 Paul Duetting , Vahab Mirrokni , Renato Paes Leme , Haifeng Xu , Song Zuo
‹ Prev 1 2 3 10 Next ›