44 search results - page 4 / 9 » Some Tractable Combinatorial Auctions |
UAI
2008
13 years 8 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
MFCS
2005
Springer
14 years 5 days ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
IAT
2009
IEEE
14 years 1 months ago
2009
IEEE
As the use of automated negotiations becomes more mainstream, one key attribute that needs to be incorporated is a measure of a seller’s trust or reliability. In this paper, we ...
AAAI
2004
13 years 8 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...