Omer Tamuz

Orcid: 0000-0002-0111-0418

According to our database1, Omer Tamuz authored at least 36 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Power of Two in Token Systems.
CoRR, 2024

2023
The Hazards and Benefits of Condescension in Social Learning.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Monotone Additive Statistics.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Learning in Repeated Interactions on Networks.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Private Private Information.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021
Feasible joint posterior beliefs (through examples).
SIGecom Exch., 2021

2020
Repeated coordination with private learning.
J. Econ. Theory, 2020

Feasible Joint Posterior Beliefs.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019
Equitable Voting Rules.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
The speed of sequential asymptotic learning.
J. Econ. Theory, 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. Econ. Theory, 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, 2015

2014
Opinion Exchange Dynamics.
CoRR, 2014

On the Speed of Social Learning.
CoRR, 2014

Majority dynamics and aggregation of information in social networks.
Auton. Agents Multi Agent Syst., 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 J. Sel. Areas Commun., 2013

Testing Booleanity and the Uncertainty Principle.
Chic. 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.
Soc. Choice Welf., 2012

Strategic Learning and the Topology of Social Networks
CoRR, 2012

Textual Features for Programming by Example
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

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
Efficient Bayesian Learning in Social Networks with Gaussian Estimators
CoRR, 2010

Iterative maximum likelihood on networks.
Adv. Appl. Math., 2010

Truthful Fair Division.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010


  Loading...