Sciweavers

602 search results - page 15 / 121
» Auctioning transformable goods
Sort
View
JCSS
2008
138views more  JCSS 2008»
13 years 7 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
ATAL
2003
Springer
14 years 19 days ago
Miscomputing ratio: social cost of selfish computing
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
Kate Larson, Tuomas Sandholm
ICDCS
2002
IEEE
14 years 11 days ago
Bidding for Storage Space in a Peer-to-Peer Data Preservation System
Digital archives protect important data collections from failures by making multiple copies at other archives, so that there are always several good copies of a collection. In a c...
Brian F. Cooper, Hector Garcia-Molina
IOR
2011
96views more  IOR 2011»
12 years 10 months ago
An Ascending Vickrey Auction for Selling Bases of a Matroid
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
Sushil Bikhchandani, Sven de Vries, James Schummer...
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 11 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...