Sciweavers

197 search results - page 1 / 40
» Bidding and allocation in combinatorial auctions
Sort
View
WECWIS
2005
IEEE
153views ECommerce» more  WECWIS 2005»
13 years 10 months ago
A Framework for Computing the Outcome of Proxied Combinatorial Auctions
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
Jie Zhong, Peter R. Wurman
ATAL
2008
Springer
13 years 6 months ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal
ACMICEC
2003
ACM
152views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
Viet Dung Dang, Nicholas R. Jennings
IPPS
2005
IEEE
13 years 10 months ago
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
In this paper, we introduce the combinatorial auction model for resource management in grids. We propose a combinatorial auction-based resource allocation protocol in which a user...
Anubhav Das, Daniel Grosu
SIGECOM
2000
ACM
227views ECommerce» more  SIGECOM 2000»
13 years 9 months ago
Combinatorial auctions for supply chain formation
Supply chain formation presents difficult coordination issues for distributed negotiation protocols. Agents must simultaneously negotiate production relationships at multiple lev...
William E. Walsh, Michael P. Wellman, Fredrik Ygge