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...
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...
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...
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...
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, ...