Sciweavers

16 search results - page 3 / 4
» Universally optimal privacy mechanisms for minimax agents
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
Selling Privacy at Auction
We initiate the study of markets for private data, through the lens of differential privacy. Although the purchase and sale of private data has already begun on a large scale, a t...
Arpita Ghosh, Aaron Roth
SIGECOM
2009
ACM
91views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Destroy to save
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
ACSAC
2003
IEEE
14 years 27 days ago
Making Secure TCP Connections Resistant to Server Failures
Methods are presented to increase resiliency to server failures by migrating long running, secure TCP-based connections to backup servers, thus mitigating damage from servers disa...
Hailin Wu, Andrew Burt, Ramki Thurimella
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
14 years 26 days ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
CORR
2008
Springer
172views Education» more  CORR 2008»
13 years 7 months ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik