Mechanism design on discrete lines and cycles E Dokow, M Feldman, R Meir, I Nehama Proceedings of the 13th ACM conference on electronic commerce, 423-440, 2012 | 87 | 2012 |
ANALYZING GAMES WITH AMBIGUOUS PLAYER TYPES USING THE MINTHENMAX DECISION MODEL I NEHAMA | 31* | 2011 |
Prophets and secretaries with overbooking T Ezra, M Feldman, I Nehama arXiv preprint arXiv:1805.05094, 2018 | 17 | 2018 |
Solving constraints on the invisible bits of the intermediate result for floating-point verification M Aharoni, S Asaf, R Maharik, I Nehama, I Nikulshin, A Ziv 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 76-83, 2005 | 11 | 2005 |
Manipulation-resistant facility location mechanisms for ZV-line graphs I Nehama, T Todo, M Yokoo arXiv preprint arXiv:1804.03759, 2018 | 10 | 2018 |
Complexity of optimal lobbying in threshold aggregation I Nehama Algorithmic Decision Theory: 4th International Conference, ADT 2015 …, 2015 | 7 | 2015 |
Manipulation-resistant false-name-proof facility location mechanisms for complex graphs I Nehama, T Todo, M Yokoo Autonomous Agents and Multi-Agent Systems 36 (1), 12, 2022 | 5 | 2022 |
Evolutionary foundation for heterogeneity in risk aversion Y Heller, I Nehama Journal of Economic Theory 208, 105617, 2023 | 4 | 2023 |
Making the most of potential: potential games and genotypic convergence O Edhan, Z Hellman, I Nehama Royal Society Open Science 8 (8), 210309, 2021 | 1 | 2021 |
Almost Quasi-linear Utilities in Disguise: Positive-representation An Extension of Roberts' Theorem I Nehama arXiv preprint arXiv:1910.12131, 2019 | 1 | 2019 |
Analyzing Games with Ambiguous Player Types I Nehama | | 2016 |
םילשוריב תירבעה הטיסרבינואה I NEHAMA | | 2011 |
Another proof of Gibbard-Satterthwaite Theorem and implications for infinite number of voters I Nehama | | 2010 |
Implementing Social Choice Correspondences using k-Strong Nash Equilibrium I Nehama | | 2009 |
Almost quasi-linear utilities in disguise: An extension of Roberts’ theorem I Nehama | | |