# Omer Tamuz

According to our database

Collaborative distances:

^{1}, Omer Tamuz authored at least 38 papers between 2010 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

The speed of sequential asymptotic learning.

J. Economic Theory, 2018

A Deterministic Protocol for Sequential Asymptotic Learning.

CoRR, 2018

Quasi-regular sequences and optimal schedules for security games.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Social Learning Equilibria.

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

A Deterministic Protocol for Sequential Asymptotic Learning.

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Non-Exploitable Protocols for Repeated Cake Cutting.

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2016

Graphical potential games.

J. Economic Theory, 2016

Quasi-regular sequences and optimal schedules for security games.

CoRR, 2016

Efficient Bayesian Learning in Social Networks with Gaussian Estimators.

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

OMG UR Funny! Computer-Aided Humor with an Application to Chat.

Proceedings of the Sixth International Conference on Computational Creativity, Park City, Utah, USA, June 29, 2015

2014

Opinion Exchange Dynamics.

CoRR, 2014

On the Speed of Social Learning.

CoRR, 2014

Graphical potential games.

CoRR, 2014

Majority dynamics and aggregation of information in social networks.

Autonomous Agents and Multi-Agent Systems, 2014

2013

Making Consensus Tractable.

ACM Trans. Economics and Comput., 2013

A lower bound on seller revenue in single buyer monopoly auctions.

Oper. Res. Lett., 2013

Tractable Bayesian Social Learning on Trees.

IEEE Journal on Selected Areas in Communications, 2013

Testing Booleanity and the Uncertainty Principle.

Chicago J. Theor. Comput. Sci., 2013

A Machine Learning Framework for Programming by Example.

Proceedings of the 30th International Conference on Machine Learning, 2013

2012

Complete characterization of functions satisfying the conditions of Arrow's theorem.

Social Choice and Welfare, 2012

Testing Booleanity and the Uncertainty Principle.

Electronic Colloquium on Computational Complexity (ECCC), 2012

Lower Bounds on Revenue of Approximately Optimal Auctions

CoRR, 2012

Strategic Learning and the Topology of Social Networks

CoRR, 2012

Textual Features for Programming by Example

CoRR, 2012

Majority Dynamics and Aggregation of Information in Social Networks

CoRR, 2012

A lower bound on seller revenue in single buyer monopoly auctions

CoRR, 2012

Testing Booleanity and the Uncertainty Principle

CoRR, 2012

Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit

CoRR, 2012

Lower Bounds on Revenue of Approximately Optimal Auctions.

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Tractable Bayesian social learning on trees.

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Social Learning in a Changing World

CoRR, 2011

Adaptively Learning the Crowd Kernel

CoRR, 2011

Efficient Bayesian Social Learning on Trees

CoRR, 2011

Social Learning in a Changing World.

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Adaptively Learning the Crowd Kernel.

Proceedings of the 28th International Conference on Machine Learning, 2011

2010

Truthful Fair Division

CoRR, 2010

Efficient Bayesian Learning in Social Networks with Gaussian Estimators

CoRR, 2010

Truthful Fair Division.

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010