Sciweavers

3433 search results - page 20 / 687
» Heuristics for a bidding problem
Sort
View
MAGS
2010
92views more  MAGS 2010»
13 years 2 months ago
Sequential auctions for common value objects with budget constrained bidders
This paper analyzes sequential auctions for budget constrained bidders, for multiple heterogeneous common value objects. In most auctions, bidders not only have valuations for obj...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
CSCLP
2004
Springer
14 years 1 months ago
Super Solutions for Combinatorial Auctions
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
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...
HEURISTICS
2002
81views more  HEURISTICS 2002»
13 years 7 months ago
Heuristics for the Phylogeny Problem
In view of the strong increasing number of phylogeny problems and instances, the assessment of the respective optimization algorithms has become harder too. This paper contributes ...
Alexandre A. Andreatta, Celso C. Ribeiro
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
14 years 26 days ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
Wolfram Conen, Tuomas Sandholm