Research

I am a lecturer at the Department of Exact Sciences at the University of Haifa at Oranim.

 I did my Ph.D. with Noam Nisan at The Hebrew University of Jerusalem at The Federmann Center for the Study of Rationality and Selim and Rachel Benin School of Computer Science and Engineering.

 Thesis title: Computational Issues in Judgment Aggregation

I received my Master's degree in the summer of 2009 from the Computer Science School at the Hebrew University. Advisor: Prof. Gil Kalai. 

Master thesis subject: Implementing social choice correspondences using k-strong Nash equilibrium.

 I am interested in game theory, particularly social choice, aggregation theory, and mechanism design.

 Publications

• Evolutionary Foundation for Heterogeneity in Risk Aversion - with Yuval Heller
  Journal of Economic Theory, 2023, Vol. 208
  Paper 

• Manipulation-Resistant False-Name-Proof Facility Location Mechanisms for Complex Graphs -   with Taiki Todo and Makoto Yokoo. 
  Autonomous Agents and Multi-Agent Systems (2022) 36:12
  Paper

• Making the most of potential: potential games and genotypic convergence - with Omer Edhan and Ziv Hellman.
  Royal Society Open Science., 2021, Vol. 8 (8)
  Paper 

• Almost quasi-linear utilities in disguise: Positive representation. An extension of Roberts' theorem.
  The 15th conference on web and internet economics (WINE 2019).
  arXiv version

• Manipulation-resistant facility location mechanisms for ZV-line graphs
  with Taiki Todo and Makoto Yokoo. 
  The 18th International Conference on Autonomous Agents and Multi-agent Systems (AAMAS 2019). 
  paper (AAMAS 2019) Full version.

• Prophets and Secretaries with Overbooking
  with Tomer Ezra and Michal Feldman.
  19th ACM Conference on Electronic Commerce (EC '18).
  Paper   Full version

• Analyzing Games with Ambiguous Player Types using the MINthenMAX Decision Model.
  The 16th International Conference on Autonomous Agents and Multi-agent Systems (AAMAS 2017)
  paper (AAMAS 2017) Full version Poster

• Complexity of Optimal Lobbying in Threshold Aggregation.
  Algorithmic Game Theory (ADT) 2015 p. 379 - 395.
  Paper   Full version

• Mechanism Design on Discrete Lines and Cycles
  with Elad Dokow, Michal Feldman, and Reshef Meir.
  13th ACM Conference on Electronic Commerce (EC '12).
  Paper   Full version

• Approximately Classic Judgement Aggregation. (Supersedes "Approximate Judgement Aggregation")
  The Annals of Mathematics & Artificial Intelligence (AMAI), July 2013, Volume 68, Issue 1, p. 91 - 134,
  Special issue on algorithms, approximation, and empirical studies in behavioral and computational social choice.
  Paper

• Approximate Judgement Aggregation.
  Internet and Network Economics (WINE 2011).
  Paper (WINE 2011)  Poster (Workshop on Innovations in Algorithmic Game Theory - May 2011) 

Work in progress

• Almost quasi-linear utilities in disguise: (alpha-beta)-Representation. An extension of Roberts' theorem. (Supersedes the WINE publication)

• Hedonic games: Four generalizations of top responsiveness & implications for (old & new) friend-appreciation games  - with Nathanël Barrot

• Utilizing symmetry in cheap talk principal-expert problems - with Yishay Mansour

• Approximately Classic Judgment Aggregation: Silencing agendas and Biased independent distributions

• A new proof of the Gibbard-Satterthwaite theorem and implications for an infinite number of voters

Selected Talks

• Learning, Evolution, and Games (LEG), July 2022
  Evolutionary Foundation for Heterogeneity in Risk Aversion

• The Israel algorithmic game theory seminar, December 2020.
  Almost quasi-linear utilities in disguise: An extension of Roberts’ theorem

• Departmental seminar, Department of economics, Haifa University, November 2020.
  Almost quasi-linear utilities in disguise: An extension of Roberts’ theorem

• Departmental seminar, Department of computer science, Ariel University, November 2020.
  Manipulation-resistant false-name-proof facility location mechanisms for complex graphs

• Departmental seminar, Dep. of industrial engineering and management, Ben-Gurion University, November 2020.
  Manipulation-resistant false-name-proof facility location mechanisms for complex graphs

• Online social choice seminar series, organized at the University of Auckland, November 2020.
  Manipulation-resistant false-name-proof facility location mechanisms for complex graphs

• Game theory seminar, Technion, January 2020.
  Almost quasi-linear utilities in disguise: An extension of Roberts’ theorem

• Haifa Social Choice Workshop, December 2019.
  Manipulation-resistant facility location mechanisms for ZV-line graphs

• The 7th International Workshop on Computational Social Choice, June 2018.
  Manipulation-resistant facility location mechanisms for ZV-line graphs

• The 14th Meeting of the Society for Social Choice and Welfare, July 2018.
  Manipulation-resistant facility location mechanisms for ZV-line graphs

• The 5th World Congress of the Game Theory Society (GAMES), July 2016.
  Analyzing games with ambiguous players types using the MINthenMAX decision rule

• The 13th Meeting of the Society for Social Choice and Welfare, July 2016.
  Analyzing games with ambiguous players types using the MINthenMAX decision rule

• Mechanism design seminar, Tel-Aviv university, March 2016.
  Analyzing games with ambiguous players types using the MINthenMAX decision rule

• Economics seminar, Royal Holloway, University of London, October 2015.
  Approximately classic judgment aggregation

• Game Theory and E-Commerce seminar, Technion, June 2015.
  Complexity of optimal lobbying in threshold aggregation

• Joint MOVE-Federmann Center workshop on Game Theory and its Applications, Barcelona, May 2015.
  Complexity of optimal lobbying in threshold aggregation

• Dagstuhl seminar - JA4AI: Judgment Aggregation for Artificial Intelligence, May 2014.
  Complexity of optimal lobbying in threshold aggregation

• The 22nd Annual Rationality Conference, February 2013.
  Probabilistic analysis of social preference rules

• The 5th Israeli Game Theory conference, June 2013.
  Complexity of optimal lobbying in threshold aggregation

• The 4th Israeli Game Theory conference, May 2012.
  Approximate Judgement Aggregation

• Dagstuhl seminar - Computation and Incentives in Social Choice, March 2012.
  Approximate Judgement Aggregation

• The 4th World Congress of the Game Theory Society (GAMES), August 2012.
  Approximate Judgement Aggregation

• The 11th Meeting of the Society for Social Choice and Welfare, August 2012.
  Approximate Judgement Aggregation

• Tel Aviv International Workshop on Game Theory, June 2011.
  Poster - Approximate Judgement Aggregation

• The 20th Annual Rationality Conference, January 2011.
  Judgment aggregation & approximate judgment aggregation

• Third International Workshop on Computational Social Choice, September 2010.
  Approximate Judgement Aggregation paper presentation

• Bertinoro Workshop on Frontiers in Mechanism Design, March 2010.
  Approximate Aggregation for the Doctrinal Paradox

• The 19th Annual Rationality Conference, January 2010.
  A new proof of the Gibbard-Satterthwaite theorem and implications for an infinite number of voters

• The Hebrew university, Computer Science Theory Seminar, June 02, 2009.
  Implementing social choice correspondences using k-Strong Nash Equilibrium

• The 18th Annual Rationality Conference February 2009.
  Implementing social choice correspondences using k-Strong Nash Equilibrium.