Seguir
Shahar Dobzinski
Shahar Dobzinski
Afiliação desconhecida
E-mail confirmado em cs.cornell.edu - Página inicial
Título
Citado por
Citado por
Ano
On bitcoin and red balloons
M Babaioff, S Dobzinski, S Oren, A Zohar
Proceedings of the 13th ACM conference on electronic commerce, 56-73, 2012
3932012
Approximation algorithms for combinatorial auctions with complement-free bidders
S Dobzinski, N Nisan, M Schapira
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
3262005
Multi-unit auctions with budget limits
S Dobzinski, R Lavi, N Nisan
Games and Economic Behavior 74 (2), 486-503, 2012
2772012
An improved approximation algorithm for combinatorial auctions with submodular bidders
S Dobzinski, M Schapira
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
2232006
Truthful randomized mechanisms for combinatorial auctions
S Dobzinski, N Nisan, M Schapira
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
1772006
On the power of randomization in algorithmic mechanism design
S Dobzinski, S Dughmi
SIAM Journal on Computing 42 (6), 2287-2304, 2013
1262013
Mechanisms for multi-unit auctions
S Dobzinski, N Nisan
Proceedings of the 8th ACM conference on Electronic commerce, 346-351, 2007
1252007
Two randomized mechanisms for combinatorial auctions
S Dobzinski
International Workshop on Approximation Algorithms for Combinatorial …, 2007
1232007
An impossibility result for truthful combinatorial auctions with submodular valuations
S Dobzinski
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
1032011
Sketching valuation functions
A Badanidiyuru, S Dobzinski, H Fu, R Kleinberg, N Nisan, T Roughgarden
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
902012
An optimal lower bound for anonymous scheduling mechanisms
I Ashlagi, S Dobzinski, R Lavi
Proceedings of the 10th ACM conference on Electronic commerce, 169-176, 2009
832009
Truthful approximation schemes for single-parameter agents
P Dhangwatnotai, S Dobzinski, S Dughmi, T Roughgarden
SIAM Journal on Computing 40 (3), 915-933, 2011
822011
Optimal auctions with correlated bidders are easy
S Dobzinski, H Fu, RD Kleinberg
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
802011
Efficiency guarantees in auctions with budgets
S Dobzinski, RP Leme
International Colloquium on Automata, Languages, and Programming, 392-404, 2014
772014
Limitations of vcg-based mechanisms
S Dobzinski, N Nisan
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
772007
The computational complexity of truthfulness in combinatorial auctions
S Dobzinski, J Vondrák
Proceedings of the 13th ACM Conference on Electronic Commerce, 405-422, 2012
722012
Economic efficiency requires interaction
S Dobzinski, N Nisan, S Oren
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
702014
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
S Dobzinski, M Sundararajan
Proceedings of the 9th ACM conference on Electronic commerce, 38-47, 2008
662008
From query complexity to computational complexity
S Dobzinski, J Vondrák
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
582012
Mechanisms for complement-free procurement
S Dobzinski, CH Papadimitriou, Y Singer
Proceedings of the 12th ACM conference on Electronic commerce, 273-282, 2011
582011
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20