The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz...
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
Auctions have become popular in conducting trade negotiations on the Internet. The design of new auction formats and other negotiation protocols has become an important topic for r...
Abstract. Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buyers when trying to determine the best set of prov...
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...