Nimrod Talmon

1.7k total citations
66 papers, 526 citations indexed

About

Nimrod Talmon is a scholar working on Economics and Econometrics, Management Science and Operations Research and Computational Theory and Mathematics. According to data from OpenAlex, Nimrod Talmon has authored 66 papers receiving a total of 526 indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Economics and Econometrics, 34 papers in Management Science and Operations Research and 27 papers in Computational Theory and Mathematics. Recurrent topics in Nimrod Talmon's work include Game Theory and Voting Systems (46 papers), Auction Theory and Applications (29 papers) and Complexity and Algorithms in Graphs (19 papers). Nimrod Talmon is often cited by papers focused on Game Theory and Voting Systems (46 papers), Auction Theory and Applications (29 papers) and Complexity and Algorithms in Graphs (19 papers). Nimrod Talmon collaborates with scholars based in Israel, Poland and Germany. Nimrod Talmon's co-authors include Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Rolf Niedermeier, Robert Bredereck, Markus Brill, Danny Hermelin, Dvir Shabtay, Jiehua Chen and Haris Aziz and has published in prestigious journals such as European Journal of Operational Research, IEEE Access and Cognitive Science.

In The Last Decade

Nimrod Talmon

58 papers receiving 518 citations

Peers

Nimrod Talmon

EE

MSOR

CTM

AI

CNC

Robert Bredereck Germany

Peter Sudhölter Denmark

Sascha Kurz Germany

William S. Zwicker United States

Rida Laraki France

Piotr Skowron Poland

Nadja Betzler Germany

Anne van den Nouweland United States

H.C.M. de Swart Netherlands

J.M. Bilbao Spain

Robert Bredereck Germany

Nimrod Talmon

313 ×0.9

EE

219 ×0.9

MSOR

207 ×1.2

CTM

140 ×1.1

AI

48 ×0.8

CNC

Citations per year, relative to Nimrod Talmon Nimrod Talmon (= 1×) peers Robert Bredereck

Countries citing papers authored by Nimrod Talmon

Since Specialization

Citations

This map shows the geographic impact of Nimrod Talmon'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 Nimrod Talmon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nimrod Talmon more than expected).

Fields of papers citing papers by Nimrod Talmon

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nimrod Talmon. 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 Nimrod Talmon. The network helps show where Nimrod Talmon may publish in the future.

Co-authorship network of co-authors of Nimrod Talmon

This figure shows the co-authorship network connecting the top 25 collaborators of Nimrod Talmon. A scholar is included among the top collaborators of Nimrod Talmon 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 Nimrod Talmon. Nimrod Talmon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Faliszewski, Piotr, et al.. (2025). How similar are two elections?. Journal of Computer and System Sciences. 150. 103632–103632.

2.

Elkind, Edith, Davide Grossi, Ehud Shapiro, & Nimrod Talmon. (2024). United for change: deliberative coalition formation to change the status quo. Social Choice and Welfare. 63(3-4). 717–746.

3.

Talmon, Nimrod, et al.. (2024). Controlling Delegations in Liquid Democracy. 2624–2632.

4.

Reichman, Daniel, Falk Lieder, David Bourgin, Nimrod Talmon, & Thomas L. Griffiths. (2023). The Computational Challenges of Means Selection Problems: Network Structure of Goal Systems Predicts Human Performance. Cognitive Science. 47(8). e13330–e13330. 1 indexed citations

5.

Saurabh, Saket, et al.. (2023). Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica. 85(12). 3717–3740. 2 indexed citations

6.

Faliszewski, Piotr, et al.. (2020). Drawing a Map of Elections in the Space of Statistical Cultures. Jagiellonian University Repository (Jagiellonian University). 1341–1349. 13 indexed citations

7.

Faliszewski, Piotr, et al.. (2019). Proportional Representation in Elections: STV vs PAV. Jagiellonian University Repository (Jagiellonian University). 1946–1948.

8.

Shapiro, Ehud, et al.. (2019). Sybil-Resilient Conductance-Based Community Expansion. arXiv (Cornell University). 1 indexed citations

9.

Aziz, Haris, et al.. (2018). Proportionally Representative Participatory Budgeting: Axioms and Algorithms. arXiv (Cornell University). 23–31. 20 indexed citations

10.

Faliszewski, Piotr & Nimrod Talmon. (2018). Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule. Adaptive Agents and Multi-Agents Systems. 14–22. 6 indexed citations

11.

Dey, Palash, et al.. (2017). Proportional Representation in Vote Streams. Adaptive Agents and Multi-Agents Systems. 15–23. 3 indexed citations

12.

Talmon, Nimrod. (2017). Structured Proportional Representation. Adaptive Agents and Multi-Agents Systems. 633–641. 2 indexed citations

13.

Faliszewski, Piotr, Piotr Skowron, & Nimrod Talmon. (2017). Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. Adaptive Agents and Multi-Agents Systems. 6–14. 17 indexed citations

14.

Skowron, Piotr, et al.. (2017). Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. 6–14.

15.

Faliszewski, Piotr, et al.. (2016). Achieving Fully Proportional Representation by Clustering Voters. Adaptive Agents and Multi-Agents Systems. 296–304. 6 indexed citations

16.

Faliszewski, Piotr, Piotr Skowron, Arkadii Slinko, & Nimrod Talmon. (2016). Committee scoring rules: axiomatic classification and hierarchy. ResearchSpace (University of Auckland). 250–256. 17 indexed citations

17.

Bevern, René van, Jiehua Chen, Falk Hüffner, et al.. (2015). Approximability and parameterized complexity of multicover by c-intervals. Information Processing Letters. 115(10). 744–749. 1 indexed citations

18.

Bredereck, Robert, Piotr Faliszewski, Rolf Niedermeier, & Nimrod Talmon. (2015). Large-Scale Election Campaigns: Combinatorial Shift Bribery. Adaptive Agents and Multi-Agents Systems. 67–75. 10 indexed citations

19.

Bredereck, Robert, et al.. (2015). The complexity of degree anonymization by vertex addition. Theoretical Computer Science. 607. 16–34. 11 indexed citations

20.

Bulteau, Laurent, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, & Nimrod Talmon. (2015). Combinatorial voter control in elections. Theoretical Computer Science. 589. 99–120. 19 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.

Explore authors with similar magnitude of impact