Sciweavers

549 search results - page 20 / 110
» Computational Bundling for Auctions
Sort
View
WSC
2008
15 years 2 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
IJCAI
2001
15 years 1 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
ICRA
2006
IEEE
216views Robotics» more  ICRA 2006»
15 years 5 months ago
3D Reconstruction of Complex Structures with Bundle Adjustment: an Incremental Approach
— This paper introduces an incremental method for “Structure From Motion” of complex scenes from a video sequence. More precisely, we estimate the 3D positions of the viewed ...
E. Mouragnon, Maxime Lhuillier, Michel Dhome, Fabi...
CONCUR
2003
Springer
15 years 5 months ago
Bundle Event Structures and CCSP
We investigate which event structures can be denoted by means of closed CCS ∪ CSP expressions. Working up to isomorphism we find that • all denotable event structures are bund...
Rob J. van Glabbeek, Frits W. Vaandrager
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm