Result 1 to 20 of 169 total
Truthful randomized mechanisms for combinatorial auctions. (English)
J. Comput. Syst. Sci. 78, No. 1, 15-25 (2012).
1
A quantitative version of the Gibbard-Satterthwaite theorem for three alternatives. (English)
SIAM J. Comput. 40, No. 3, 934-952 (2011).
2
On Yao’s XOR-lemma. (English)
Goldreich, Oded (ed.), Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Berlin: Springer (ISBN 978-3-642-22669-4/pbk). Lecture Notes in Computer Science 6650, 273-301 (2011).
3
On constructing 1-1 one-way functions. (English)
Goldreich, Oded (ed.), Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Berlin: Springer (ISBN 978-3-642-22669-4/pbk). Lecture Notes in Computer Science 6650, 13-25 (2011).
4
A quantitative version of the gibbard-satterthwaite theorem for three alternatives. (English)
Comput. Res. Repos. 2011, Article No. 1105.5129 (2011).
5
Non-price equilibria in markets of discrete goods. (English)
Comput. Res. Repos. 2011, Article No. 1103.3950 (2011).
6
When is it best to best-respond? (English)
SIGecom Exchanges 10, No. 2, 16-18 (2011).
7
On yao’s XOR-lemma (English)
Studies in Complexity and Cryptography, 273-301 (2011).
8
On constructing 1-1 one-way functions (English)
Studies in Complexity and Cryptography, 13-25 (2011).
9
Incentive-compatible distributed greedy protocols (English)
PODC, 335-336 (2011).
10
Non-price equilibria in markets of discrete goods (English)
ACM Conference on Electronic Commerce, 295-296 (2011).
11
Best-response auctions (English)
ACM Conference on Electronic Commerce, 351-360 (2011).
12
Multi-unit auctions: beyond roberts (English)
ACM Conference on Electronic Commerce, 233-242 (2011).
13
Best-response mechanisms (English)
ICS, 155-165 (2011).
14
Approximation algorithms for combinatorial auctions with complement-free bidders. (English)
Math. Oper. Res. 35, No. 1, 1-13 (2010).
15
Mixed strategies in combinatorial agency. (English)
J. Artif. Intell. Res. (JAIR) 38, 339-369 (2010).
16
Multi-unit auctions: beyond roberts. (English)
Comput. Res. Repos. 2010, Article No. 1004.1449 (2010).
17
Approximation algorithms for combinatorial auctions with complement-free bidders (English)
Math. Oper. Res. 35, No. 1, 1-13 (2010).
18
Google’s auction for TV AdS (English)
SODA, 741 (2010).
19
On the computational power of demand queries. (English)
SIAM J. Comput. 39, No. 4, 1372-1391 (2009).
20
Result 1 to 20 of 169 total
Start
Contact
Print
General Help
