Ilan Nehama

发表

Approximately classic judgement aggregation

Ilan Nehama, Ilan Nehama, 2010, Annals of Mathematics and Artificial Intelligence.

Prophets and Secretaries with Overbooking

Michal Feldman, Tomer Ezra, Ilan Nehama, 2018, EC.

Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model

Ilan Nehama, Ilan Nehama, 2016, AAMAS.

Almost Quasi-linear Utilities in Disguise: Positive-representation An Extension of Roberts' Theorem

Ilan Nehama, Ilan Nehama, 2019, ArXiv.

Manipulation-resistant facility location mechanisms for ZV-line graphs

Makoto Yokoo, Taiki Todo, Ilan Nehama, 2018, AAMAS.

Solving constraints on the invisible bits of the intermediate result for floating-point verification

Sigal Asaf, Merav Aharoni, Ilan Nehama, 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

Complexity of Optimal Lobbying in Threshold Aggregation

Ilan Nehama, Ilan Nehama, 2013, ADT.

Mechanism design on discrete lines and cycles

Michal Feldman, Reshef Meir, Ilan Nehama, 2012, EC '12.

Approximate Judgement Aggregation pdf

Ilan Nehama, Ilan Nehama, 2011, WINE.

Supplementary material from "Making the most of potential: potential games and genotypic convergence"

Ilan Nehama, 2021 .

Evolutionary Foundation for Heterogeneity in Risk Aversion pdf

Yuval Heller, Ilan Nehama, 2021, SSRN Electronic Journal.

Complexity of Optimal Lobbying in Threshold Aggregation (Extended Abstract)

Ilan Nehama, 2013 .