101 search results - page 14 / 21 » Approximation algorithms and online mechanisms for item pric... |
92
Voted
AI
2002
Springer
14 years 9 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
DSS
2006
14 years 9 months ago
2006
The increasing proliferation of online shopping and purchasing has naturally led to a growth in the popularity of comparisonshopping search engines, popularly known as "shopb...