Sciweavers

549 search results - page 12 / 110
» Computational Bundling for Auctions
Sort
View
ICAI
2004
15 years 1 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger
WECWIS
2006
IEEE
141views ECommerce» more  WECWIS 2006»
15 years 5 months ago
Iterative Combinatorial Auctions with Linear Prices: Results of Numerical Experiments
Iterative Combinatorial Auctions (ICA) have been getting increasing attention in computer science and economics, as they provide an efficient solution to resource allocation prob...
Alexander Pikovsky, Pasha Shabalin, Martin Bichler
ATAL
2008
Springer
15 years 1 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
CHI
2010
ACM
15 years 6 months ago
Lumino: tangible blocks for tabletop computers based on glass fiber bundles
Tabletop computers based on diffuse illumination can track fiducial markers placed on the table’s surface. In this paper, we demonstrate how to do the same with objects arranged...
Patrick Baudisch, Torsten Becker, Frederik Rudeck
ATAL
2008
Springer
15 years 1 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss