Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Algorithmic Game Theory
20071.4k citationsNoam Nisan, Christos H. Papadimitriou et al.Cambridge University Press eBooksprofile →
Citations per year, relative to Noam Nisan Noam Nisan (= 1×)
peers
Éva Tardos
Countries citing papers authored by Noam Nisan
Since
Specialization
Citations
This map shows the geographic impact of Noam Nisan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Noam Nisan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Noam Nisan more than expected).
This network shows the impact of papers produced by Noam Nisan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Noam Nisan. The network helps show where Noam Nisan may publish in the future.
Co-authorship network of co-authors of Noam Nisan
This figure shows the co-authorship network connecting the top 25 collaborators of Noam Nisan.
A scholar is included among the top collaborators of Noam Nisan based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Noam Nisan. Noam Nisan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Nisan, Noam, Christos H. Papadimitriou, Éva Tardos, et al.. (2007). Algorithmic Game Theory. Cambridge University Press eBooks.1422 indexed citations breakdown →
3.
Nisan, Noam. (2006). A Note on the computational hardness of evolutionary stable strategies.. Electronic colloquium on computational complexity. 13.3 indexed citations
4.
Dobzinski, Shahar & Noam Nisan. (2006). Approximations by Computationally-Efficient VCG-Based Mechanisms.. Electronic colloquium on computational complexity. 13.1 indexed citations
5.
Nisan, Noam & Ilya Segal. (2005). Exponential communication inefficiency of demand queries. 158–164.9 indexed citations
Abraham, Ittai, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, & Mikkel Thorup. (2004). Compact Name-Independent Routing with Minimum Stretch. HAL (Le Centre pour la Communication Scientifique Directe).1 indexed citations
9.
Nisan, Noam, et al.. (2003). Proceedings of the 4th ACM conference on Electronic commerce.27 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.