# Shahar Dobzinski

According to our database

Collaborative distances:

^{1}, Shahar Dobzinski authored at least 55 papers between 2006 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

CoRR, 2021

CoRR, 2021

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

CoRR, 2020

2019

Games Econ. Behav., 2019

Algorithmica, 2019

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

SIGecom Exch., 2018

Games Econ. Behav., 2018

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017

ACM Trans. Algorithms, 2017

2016

Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations.

J. ACM, 2016

CoRR, 2016

Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders.

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

J. Econ. Theory, 2015

Games Econ. Behav., 2015

CoRR, 2015

CoRR, 2015

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Proceedings of the ACM Conference on Economics and Computation, 2014

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

SIAM J. Comput., 2013

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Math. Oper. Res., 2012

J. Comput. Syst. Sci., 2012

Games Econ. Behav., 2012

On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations

CoRR, 2012

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011

SIGecom Exch., 2011

SIAM J. Comput., 2011

Comb., 2011

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

An impossibility result for truthful combinatorial auctions with submodular valuations.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010

Math. Oper. Res., 2010

J. Artif. Intell. Res., 2010

CoRR, 2010

2009

SIGecom Exch., 2009

CoRR, 2009

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On characterizations of truthful mechanisms for combinatorial auctions and scheduling.

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

SIGecom Exch., 2007

IEEE J. Sel. Areas Commun., 2007

Proceedings of the Approximation, 2007

2006

Electron. Colloquium Comput. Complex., 2006

An improved approximation algorithm for combinatorial auctions with submodular bidders.

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006