default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmer Tamuz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Fedor Sandomirskiy
, Omer Tamuz:
Decomposable Stochastic Choice. EC 2024: 1195- [i23]Itai Ashlagi, Süleyman Kerimov, Omer Tamuz:
The Power of Two in Token Systems. CoRR abs/2405.12414 (2024) - 2023
- [c19]Itai Arieli, Yakov Babichenko, Stephan Müller, Farzad Pourbabaee, Omer Tamuz:
The Hazards and Benefits of Condescension in Social Learning. EC 2023: 119 - [i22]Itai Arieli, Yakov Babichenko, Stephan Müller, Farzad Pourbabaee, Omer Tamuz:
The Hazards and Benefits of Condescension in Social Learning. CoRR abs/2301.11237 (2023) - 2022
- [c18]Xiaosheng Mu, Luciano Pomatto, Philipp Strack, Omer Tamuz:
Monotone Additive Statistics. EC 2022: 34 - [c17]Wanying Huang, Philipp Strack, Omer Tamuz:
Learning in Repeated Interactions on Networks. EC 2022: 325 - [c16]Kevin He, Fedor Sandomirskiy, Omer Tamuz:
Private Private Information. EC 2022: 1145 - 2021
- [j11]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy, Omer Tamuz:
Feasible joint posterior beliefs (through examples). SIGecom Exch. 19(1): 21-29 (2021) - [i21]Wanying Huang, Philipp Strack, Omer Tamuz:
Learning in Repeated Interactions on Networks. CoRR abs/2112.14265 (2021) - [i20]Kevin He, Fedor Sandomirskiy, Omer Tamuz:
Private Private Information. CoRR abs/2112.14356 (2021) - 2020
- [j10]Pathikrit Basu, Kalyan Chatterjee, Tetsuya Hoshino, Omer Tamuz:
Repeated coordination with private learning. J. Econ. Theory 190: 105106 (2020) - [c15]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy, Omer Tamuz:
Feasible Joint Posterior Beliefs. EC 2020: 643 - [i19]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy, Omer Tamuz:
Feasible Joint Posterior Beliefs. CoRR abs/2002.11362 (2020)
2010 – 2019
- 2019
- [c14]Laurent Bartholdi, Wade Hann-Caruthers, Maya Josyula, Omer Tamuz, Leeat Yariv:
Equitable Voting Rules. EC 2019: 315 - 2018
- [j9]Wade Hann-Caruthers, Vadim V. Martynov, Omer Tamuz:
The speed of sequential asymptotic learning. J. Econ. Theory 173: 383-409 (2018) - [c13]Omer Tamuz, Shai Vardi, Juba Ziani:
Non-Exploitable Protocols for Repeated Cake Cutting. AAAI 2018: 1226-1233 - [c12]Yu Cheng, Wade Hann-Caruthers, Omer Tamuz:
A Deterministic Protocol for Sequential Asymptotic Learning. ISIT 2018: 1735-1738 - [c11]Elchanan Mossel, Manuel Mueller-Frank, Allan Sly, Omer Tamuz:
Social Learning Equilibria. EC 2018: 639 - [c10]David Kempe, Leonard J. Schulman, Omer Tamuz:
Quasi-regular sequences and optimal schedules for security games. SODA 2018: 1625-1644 - [i18]Yu Cheng, Wade Hann-Caruthers, Omer Tamuz:
A Deterministic Protocol for Sequential Asymptotic Learning. CoRR abs/1802.06871 (2018) - 2016
- [j8]Yakov Babichenko, Omer Tamuz:
Graphical potential games. J. Econ. Theory 163: 889-899 (2016) - [c9]Elchanan Mossel, Noah Olsman, Omer Tamuz:
Efficient Bayesian Learning in Social Networks with Gaussian Estimators. Allerton 2016: 425-432 - [i17]David Kempe, Leonard J. Schulman, Omer Tamuz:
Quasi-regular sequences and optimal schedules for security games. CoRR abs/1611.07169 (2016) - 2015
- [c8]Miaomiao Wen, Nancy Baym, Omer Tamuz, Jaime Teevan, Susan T. Dumais, Adam Kalai:
OMG UR Funny! Computer-Aided Humor with an Application to Chat. ICCC 2015: 86-93 - 2014
- [j7]Elchanan Mossel, Joe Neeman, Omer Tamuz:
Majority dynamics and aggregation of information in social networks. Auton. Agents Multi Agent Syst. 28(3): 408-429 (2014) - [i16]Elchanan Mossel, Omer Tamuz:
Opinion Exchange Dynamics. CoRR abs/1401.4770 (2014) - [i15]Yakov Babichenko, Omer Tamuz:
Graphical potential games. CoRR abs/1405.1481 (2014) - [i14]Matan Harel, Elchanan Mossel, Philipp Strack, Omer Tamuz:
On the Speed of Social Learning. CoRR abs/1412.7172 (2014) - 2013
- [j6]Tom Gur, Omer Tamuz:
Testing Booleanity and the Uncertainty Principle. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j5]Yashodhan Kanoria, Omer Tamuz:
Tractable Bayesian Social Learning on Trees. IEEE J. Sel. Areas Commun. 31(4): 756-765 (2013) - [j4]Omer Tamuz:
A lower bound on seller revenue in single buyer monopoly auctions. Oper. Res. Lett. 41(5): 474-476 (2013) - [j3]Elchanan Mossel, Omer Tamuz:
Making Consensus Tractable. ACM Trans. Economics and Comput. 1(4): 20:1-20:19 (2013) - [c7]Aditya Krishna Menon, Omer Tamuz, Sumit Gulwani, Butler W. Lampson, Adam Kalai:
A Machine Learning Framework for Programming by Example. ICML (1) 2013: 187-195 - 2012
- [j2]Elchanan Mossel, Omer Tamuz:
Complete characterization of functions satisfying the conditions of Arrow's theorem. Soc. Choice Welf. 39(1): 127-140 (2012) - [c6]Yashodhan Kanoria, Omer Tamuz:
Tractable Bayesian social learning on trees. ISIT 2012: 2721-2725 - [c5]Balasubramanian Sivan, Vasilis Syrgkanis, Omer Tamuz:
Lower Bounds on Revenue of Approximately Optimal Auctions. WINE 2012: 526-531 - [i13]Elchanan Mossel, Omer Tamuz:
Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit. CoRR abs/1202.0969 (2012) - [i12]Tom Gur, Omer Tamuz:
Testing Booleanity and the Uncertainty Principle. CoRR abs/1204.0944 (2012) - [i11]Omer Tamuz:
A lower bound on seller revenue in single buyer monopoly auctions. CoRR abs/1204.5551 (2012) - [i10]Elchanan Mossel, Joe Neeman, Omer Tamuz:
Majority Dynamics and Aggregation of Information in Social Networks. CoRR abs/1207.0893 (2012) - [i9]Aditya Krishna Menon, Omer Tamuz, Sumit Gulwani, Butler W. Lampson, Adam Tauman Kalai:
Textual Features for Programming by Example. CoRR abs/1209.3811 (2012) - [i8]Elchanan Mossel, Allan Sly, Omer Tamuz:
Strategic Learning and the Topology of Social Networks. CoRR abs/1209.5527 (2012) - [i7]Balasubramanian Sivan, Vasilis Syrgkanis, Omer Tamuz:
Lower Bounds on Revenue of Approximately Optimal Auctions. CoRR abs/1210.0275 (2012) - [i6]Tom Gur, Omer Tamuz:
Testing Booleanity and the Uncertainty Principle. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c4]Omer Tamuz, Ce Liu, Serge J. Belongie, Ohad Shamir, Adam Kalai:
Adaptively Learning the Crowd Kernel. ICML 2011: 673-680 - [c3]Rafael M. Frongillo, Grant Schoenebeck, Omer Tamuz:
Social Learning in a Changing World. WINE 2011: 146-157 - [i5]Yashodhan Kanoria, Omer Tamuz:
Efficient Bayesian Social Learning on Trees. CoRR abs/1102.1398 (2011) - [i4]Omer Tamuz, Ce Liu, Serge J. Belongie, Ohad Shamir, Adam Tauman Kalai:
Adaptively Learning the Crowd Kernel. CoRR abs/1105.1033 (2011) - [i3]Rafael M. Frongillo, Grant Schoenebeck, Omer Tamuz:
Social Learning in a Changing World. CoRR abs/1109.5482 (2011) - 2010
- [j1]Elchanan Mossel, Omer Tamuz:
Iterative maximum likelihood on networks. Adv. Appl. Math. 45(1): 36-49 (2010) - [c2]Elchanan Mossel, Omer Tamuz:
Truthful Fair Division. SAGT 2010: 288-299 - [i2]Elchanan Mossel, Omer Tamuz:
Efficient Bayesian Learning in Social Networks with Gaussian Estimators. CoRR abs/1002.0747 (2010) - [i1]Elchanan Mossel, Omer Tamuz:
Truthful Fair Division. CoRR abs/1003.5480 (2010)
2000 – 2009
- 2009
- [c1]Elchanan Mossel, Omer Tamuz:
Iterative maximum likelihood on networks. Allerton 2009: 416-423
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
