default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlan Nehama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Yuval Heller
, Ilan Nehama:
Evolutionary foundation for heterogeneity in risk aversion. J. Econ. Theory 208: 105617 (2023)- 2022
- [j2]Ilan Nehama, Taiki Todo, Makoto Yokoo:
Manipulation-resistant false-name-proof facility location mechanisms for complex graphs. Auton. Agents Multi Agent Syst. 36(1): 12 (2022) - 2021
- [i6]Yuval Heller, Ilan Nehama:
Evolutionary Foundation for Heterogeneity in Risk Aversion. CoRR abs/2110.11245 (2021)
2010 – 2019
- 2019
- [c9]Ilan Nehama, Taiki Todo, Makoto Yokoo:
Manipulations-resistant Facility Location Mechanisms for ZV-line Graphs. AAMAS 2019: 1452-1460 - [c8]Ilan Nehama:
Almost Quasi-linear Utilities in Disguise: Positive-Representation an Extension of Roberts' Theorem. WINE 2019: 344-345 - [i5]Ilan Nehama:
Almost Quasi-linear Utilities in Disguise: Positive-representation An Extension of Roberts' Theorem. CoRR abs/1910.12131 (2019) - 2018
- [c7]Tomer Ezra, Michal Feldman, Ilan Nehama:
Prophets and Secretaries with Overbooking. EC 2018: 319-320 - [i4]Ilan Nehama, Taiki Todo, Makoto Yokoo:
Manipulation-resistant facility location mechanisms for ZV-line graphs. CoRR abs/1804.03759 (2018) - [i3]Tomer Ezra, Michal Feldman, Ilan Nehama:
Prophets and Secretaries with Overbooking. CoRR abs/1805.05094 (2018) - 2017
- [c6]Ilan Nehama:
Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model. AAMAS 2017: 1187-1195 - 2016
- [b1]Ilan Nehama:
Computational Issues in Judgment Aggregation (שער נוסף בעברית: נושאים חישוביים באגרגציה של שיפוטים.). Hebrew University of Jerusalem, Israel, 2016 - [i2]Ilan Nehama:
Analyzing Games with Ambiguous Player Types using the MINthenMAX Decision Model. CoRR abs/1603.01524 (2016) - 2015
- [c5]Ilan Nehama:
Complexity of Optimal Lobbying in Threshold Aggregation. ADT 2015: 379-395 - 2013
- [j1]Ilan Nehama:
Approximately classic judgement aggregation. Ann. Math. Artif. Intell. 68(1-3): 91-134 (2013) - [c4]Ilan Nehama:
Complexity of optimal lobbying in threshold aggregation. AAMAS 2013: 1197-1198 - 2012
- [c3]Elad Dokow, Michal Feldman, Reshef Meir, Ilan Nehama:
Mechanism design on discrete lines and cycles. EC 2012: 423-440 - 2011
- [c2]Ilan Nehama:
Approximate Judgement Aggregation. WINE 2011: 302-313 - 2010
- [i1]Ilan Nehama:
Approximate Judgement Aggregation. CoRR abs/1008.3829 (2010)
2000 – 2009
- 2005
- [c1]Merav Aharoni, Sigal Asaf, Ron Maharik, Ilan Nehama, Ilya Nikulshin, Abraham Ziv:
Solving Constraints on the Invisible Bits of the Intermediate Result for Floating-Point Verification. IEEE Symposium on Computer Arithmetic 2005: 76-83
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-04-25 05:38 CEST 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:
