Sciweavers

AAAI
2012
12 years 1 months ago
The Price of Neutrality for the Ranked Pairs Method
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 ...
Markus Brill, Felix A. Fischer
INFOCOM
2012
IEEE
12 years 1 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
AI
2002
Springer
13 years 10 months ago
Algorithm for optimal winner determination in combinatorial auctions
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...
Tuomas Sandholm
IJCAI
2001
14 years 2 days ago
The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming
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
IJCAI
2007
14 years 4 days ago
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control
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...
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
14 years 3 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
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, ...
HUMAN
2003
Springer
14 years 3 months ago
A Framework of Winner Determination Algorithms for Internet Auctions
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...
Juhnyoung Lee, Sang-goo Lee, Suekyung Lee
CAEPIA
2003
Springer
14 years 4 months ago
Negotiation Support in Highly-Constrained Trading Scenarios
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...
Juan A. Rodríguez-Aguilar, Antonio Reyes-Mo...
IAT
2006
IEEE
14 years 4 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
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...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
ATAL
2007
Springer
14 years 4 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal