Sciweavers

203 search results - page 24 / 41
» A New Derandomization of Auctions
Sort
View
ICMAS
2000
13 years 9 months ago
Assessing Usage Patterns to Improve Data Allocation via Auctions
The data allocation problem in incomplete information environments consisting of self-motivated servers responding to users' queries is considered. Periodically, the servers ...
Rina Azoulay-Schwartz, Sarit Kraus
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
IAT
2006
IEEE
14 years 1 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...
AUSAI
2005
Springer
14 years 1 months ago
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
Andrew Lim, Jiqing Tang
WSC
2008
13 years 9 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese