Sciweavers

203 search results - page 18 / 41
» A New Derandomization of Auctions
Sort
View
HICSS
2006
IEEE
111views Biometrics» more  HICSS 2006»
14 years 1 months ago
Can Government Be a Good eBayer? The Use of Online Auctions in the Sale of Surplus Property
E-commerce, and online auctions in particular, represent important examples of how information and communication technologies have been employed by public organizations to gain be...
Enrico Ferro, Lucy Dadayan
FOCS
2005
IEEE
14 years 1 months ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ...
Anna R. Karlin, David Kempe, Tami Tamir
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
14 years 7 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
IWINAC
2007
Springer
14 years 1 months ago
Gaining Insights into Laser Pulse Shaping by Evolution Strategies
Abstract. We consider the numerical evolutionary optimization of dynamic molecular alignment by shaped femtosecond laser pulses. We study a simplified model of this quantum contro...
Ofer M. Shir, Joost N. Kok, Thomas Bäck, Marc...
IACR
2011
115views more  IACR 2011»
12 years 7 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen