Sciweavers

1208 search results - page 242 / 242
» Uniform eventown problems
Sort
View
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
12 years 4 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
AAAI
2012
11 years 7 months ago
Optimal Auctions for Spiteful Bidders
Designing revenue-optimal auctions for various settings is perhaps the most important, yet sometimes most elusive, problem in mechanism design. Spiteful bidders have been intensel...
Pingzhong Tang, Tuomas Sandholm
INFOCOM
2009
IEEE
13 years 11 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...