Bahar, Gal; Arieli, Itai; Smorodinsky, Rann; Tennenholtz, Moshe Multi-issue social learning. (English) Zbl 1435.91134 Math. Soc. Sci. 104, 29-39 (2020). MSC: 91D15 PDF BibTeX XML Cite \textit{G. Bahar} et al., Math. Soc. Sci. 104, 29--39 (2020; Zbl 1435.91134) Full Text: DOI
Nissim, Kobbi; Smorodinsky, Rann; Tennenholtz, Moshe Segmentation, incentives, and privacy. (English) Zbl 1443.91017 Math. Oper. Res. 43, No. 4, 1252-1268 (2018). MSC: 91A10 91A80 90B60 90B80 PDF BibTeX XML Cite \textit{K. Nissim} et al., Math. Oper. Res. 43, No. 4, 1252--1268 (2018; Zbl 1443.91017) Full Text: DOI
Levy, Omer; Smorodinsky, Rann; Tennenholtz, Moshe Undivide and conquer: on selling a divisible and homogeneous good. (English) Zbl 1375.91099 B. E. J. Theor. Econ. 15, No. 1, 1-23 (2015). MSC: 91B26 PDF BibTeX XML Cite \textit{O. Levy} et al., B. E. J. Theor. Econ. 15, No. 1, 1--23 (2015; Zbl 1375.91099) Full Text: DOI
Nissim, Kobbi; Smorodinsky, Rann; Tennenholtz, Moshe Approximately optimal mechanism design via differential privacy. (English) Zbl 1348.91124 Proceedings of the 3rd conference on innovations in theoretical computer science, ITCS’12, Cambridge, MA, USA, January 8–10, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1115-1). 203-213 (2012). MSC: 91B26 90B80 91B24 PDF BibTeX XML Cite \textit{K. Nissim} et al., in: Proceedings of the 3rd conference on innovations in theoretical computer science, ITCS'12, Cambridge, MA, USA, January 8--10, 2012. New York, NY: Association for Computing Machinery (ACM). 203--213 (2012; Zbl 1348.91124) Full Text: DOI
Smorodinsky, Rann; Tennenholtz, Moshe Overcoming free riding in multi-party computations – the anonymous case. (English) Zbl 1100.94021 Games Econ. Behav. 55, No. 2, 385-406 (2006). MSC: 94A62 91A12 91B14 PDF BibTeX XML Cite \textit{R. Smorodinsky} and \textit{M. Tennenholtz}, Games Econ. Behav. 55, No. 2, 385--406 (2006; Zbl 1100.94021) Full Text: DOI