S
Zodix
Study
Academic Library
Search
Shelves
Open access
Sign in
Search or jump to…
⌘K
Shahar Dobzinski · Study
Home
/
Author
Shahar Dobzinski
19 works
· latest 2014
· 3 institutions
cluster: provisional
ORCID 0000-0003-1935-5808
Follow
Suggest an ORCID correction
h-index
19
i10
19
Citations
1,685
Works here
19
05
06
07
08
09
10
11
12
14
Most cited in this library
Truthful randomized mechanisms for combinatorial auctions
2006 · 189 citations
Approximation algorithms for combinatorial auctions with complement-free bidders
2005 · 164 citations
An improved approximation algorithm for combinatorial auctions with submodular bidders
2006 · 153 citations
Multi-unit auctions with budget limits
2011 · 148 citations
Two Randomized Mechanisms for Combinatorial Auctions
2007 · 105 citations
Works
19 shown
Economic efficiency requires interaction
ACM Symposium on Theory of Computing (STOC)
·
2014
·
3 authors
·
other
40
citations
Efficiency Guarantees in Auctions with Budgets
Lecture notes in computer science
·
2014
·
2 authors
·
other
47
citations
The computational complexity of truthfulness in combinatorial auctions
ACM Conference on Electronic Commerce (EC)
·
2012
·
2 authors
·
other
67
citations
Multi-unit auctions with budget limits
Games and Economic Behavior
·
2011
·
3 authors
148
citations
An impossibility result for truthful combinatorial auctions with submodular valuations
ACM Symposium on Theory of Computing (STOC)
·
2011
·
1 author
·
other
·
Open access
88
citations
Optimal auctions with correlated bidders are easy
ACM Symposium on Theory of Computing (STOC)
·
2011
·
3 authors
·
other
80
citations
Mechanisms for complement-free procurement
ACM Conference on Electronic Commerce (EC)
·
2011
·
3 authors
·
other
61
citations
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
Mathematics of Operations Research
·
2010
·
3 authors
92
citations
On the Power of Randomization in Algorithmic Mechanism Design
Annual Symposium on Foundations of Computer Science
·
2009
·
2 authors
·
other
48
citations
On the Power of Randomization in Algorithmic Mechanism Design
arXiv (Cornell University)
·
2009
·
2 authors
·
preprint
·
Open access
58
citations
Multi-unit Auctions with Budget Limits
Annual Symposium on Foundations of Computer Science
·
2008
·
3 authors
·
other
85
citations
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
ACM Conference on Electronic Commerce (EC)
·
2008
·
2 authors
·
other
66
citations
Limitations of VCG-based mechanisms
ACM Symposium on Theory of Computing (STOC)
·
2007
·
2 authors
·
other
62
citations
Mechanisms for multi-unit auctions
ACM Conference on Electronic Commerce (EC)
·
2007
·
2 authors
·
other
51
citations
Two Randomized Mechanisms for Combinatorial Auctions
Lecture notes in computer science
·
2007
·
1 author
·
other
105
citations
Truthful randomized mechanisms for combinatorial auctions
Journal of Computer and System Sciences
·
2006
·
3 authors
·
Open access
189
citations
An improved approximation algorithm for combinatorial auctions with submodular bidders
Symposium on Discrete Algorithms
·
2006
·
2 authors
·
other
153
citations
An improved approximation algorithm for combinatorial auctions with submodular bidders
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
2006
·
2 authors
·
other
81
citations
Approximation algorithms for combinatorial auctions with complement-free bidders
ACM Symposium on Theory of Computing (STOC)
·
2005
·
3 authors
·
other
164
citations