Prati
Shahar Dobzinski
Shahar Dobzinski
Nepoznata afilijacija
Potvrđena adresa e-pošte na cs.cornell.edu - Početna stranica
Naslov
Citirano
Citirano
Godina
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
3582012
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
2832005
Multi-unit auctions with budget limits
S Dobzinski, R Lavi, N Nisan
Games and Economic Behavior 74 (2), 486-503, 2012
2452012
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
2022006
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
1632006
On the power of randomization in algorithmic mechanism design
S Dobzinski, S Dughmi
SIAM Journal on Computing 42 (6), 2287-2304, 2013
1132013
Two randomized mechanisms for combinatorial auctions
S Dobzinski
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007
1112007
Mechanisms for multi-unit auctions
S Dobzinski, N Nisan
Proceedings of the 8th ACM conference on Electronic commerce, 346-351, 2007
1112007
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
922011
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
842012
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
812009
Truthful approximation schemes for single-parameter agents
P Dhangwatnotai, S Dobzinski, S Dughmi, T Roughgarden
SIAM Journal on Computing 40 (3), 915-933, 2011
782011
Limitations of vcg-based mechanisms
S Dobzinski, N Nisan
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
732007
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
712011
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
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
612012
Economic efficiency requires interaction
S Dobzinski, N Nisan, S Oren
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
592014
Efficiency guarantees in auctions with budgets
S Dobzinski, RP Leme
International Colloquium on Automata, Languages, and Programming, 392-404, 2014
552014
Mechanisms for complement-free procurement
S Dobzinski, CH Papadimitriou, Y Singer
Proceedings of the 12th ACM conference on Electronic commerce, 273-282, 2011
552011
From query complexity to computational complexity
S Dobzinski, J Vondrák
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
512012
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20