163 search results - page 18 / 33 » Approximate bidding algorithms for a distributed combinatori... |
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
SIGECOM
2009
ACM
14 years 1 months ago
2009
ACM
Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vick...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...