Sciweavers

549 search results - page 47 / 110
» Computational Bundling for Auctions
Sort
View
ICDCS
2002
IEEE
14 years 2 months 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
FOCS
2008
IEEE
13 years 11 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel
STOC
2009
ACM
112views Algorithms» more  STOC 2009»
14 years 10 months ago
A new approach to auctions and resilient mechanism design
We put forward a new approach to mechanism design, and exemplify it via a new mechanism guaranteeing significant revenue in unrestricted combinatorial auctions. Our mechanism ? su...
Jing Chen, Silvio Micali
ATAL
2006
Springer
14 years 1 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
FFA
2011
115views more  FFA 2011»
13 years 5 months ago
Toric residue codes: I
In this paper, we begin exploring the construction of algebraic codes from toric varieties using toric residues. Though algebraic codes have been constructed from toric varieties, ...
Roy Joshua, Reza Akhtar