default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNimrod Talmon
- > Home > Persons > Nimrod Talmon
Publications
- 2023
[j26]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Correction to: Opinion diffusion and campaigning on society graphs. J. Log. Comput. 33(3): 706 (2023)- [c73]Piotr Faliszewski
, Jaroslaw Flis, Dominik Peters, Grzegorz Pierczynski, Piotr Skowron, Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon:
Participatory Budgeting: Data, Tools and Analysis. IJCAI 2023: 2667-2674 - [i55]Piotr Faliszewski, Jaroslaw Flis, Dominik Peters, Grzegorz Pierczynski, Piotr Skowron, Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon:
Participatory Budgeting: Data, Tools, and Analysis. CoRR abs/2305.11035 (2023) - 2022
- [j24]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion diffusion and campaigning on society graphs. J. Log. Comput. 32(6): 1162-1194 (2022) - [c65]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? IJCAI 2022: 496-502 - [i51]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? CoRR abs/2207.01140 (2022) - 2021
- [j22]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021) - [j20]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13(3): 20:1-20:25 (2021) - [i46]Piotr Faliszewski, Piotr Skowron, Nimrod Talmon:
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. CoRR abs/2104.09130 (2021) - 2020
- [j18]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814: 86-105 (2020) - [c53]Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Drawing a Map of Elections in the Space of Statistical Cultures. AAMAS 2020: 1341-1349 - [c52]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
Isomorphic Distances Among Elections. CSR 2020: 64-78 - [c51]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules with Variable Number of Winners. ECAI 2020: 67-74 - [i34]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. CoRR abs/2010.00651 (2020) - 2019
- [j13]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. ACM Trans. Economics and Comput. 7(1): 3:1-3:39 (2019) - [c46]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
How Similar Are Two Elections? AAAI 2019: 1909-1916 - [c45]Nimrod Talmon, Piotr Faliszewski:
A Framework for Approval-Based Budgeting Methods. AAAI 2019: 2181-2188 - [c44]Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon:
Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS 2019: 494-502 - [c43]Piotr Faliszewski, Piotr Skowron, Stanislaw Szufa, Nimrod Talmon:
Proportional Representation in Elections: STV vs PAV. AAMAS 2019: 1946-1948 - [c41]Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski, Nimrod Talmon:
Multigoal Committee Selection. IJCAI 2019: 385-391 - [i29]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. CoRR abs/1901.09217 (2019) - 2018
- [j12]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving fully proportional representation by clustering voters. J. Heuristics 24(5): 725-756 (2018) - [j11]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives. Soc. Choice Welf. 51(3): 513-550 (2018) - [c39]Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon:
Effective Heuristics for Committee Scoring Rules. AAAI 2018: 1023-1030 - [c37]Piotr Faliszewski, Nimrod Talmon:
Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule. AAMAS 2018: 14-22 - [c35]Piotr Faliszewski, Stanislaw Szufa, Nimrod Talmon:
Optimization-Based Voting Rule Design: The Closer to Utopia the Better. AAMAS 2018: 32-40 - [c32]Haris Aziz, Piotr Faliszewski, Bernard Grofman, Arkadii Slinko, Nimrod Talmon:
Egalitarian Committee Scoring Rules. IJCAI 2018: 56-62 - [c30]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. IJCAI 2018: 219-225 - [i27]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. CoRR abs/1802.06483 (2018) - [i23]Piotr Faliszewski, Nimrod Talmon:
A Framework for Approval-based Budgeting Methods. CoRR abs/1809.04382 (2018) - 2017
- [j8]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. J. Artif. Intell. Res. 60: 937-1002 (2017) - [c28]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. AAAI 2017: 494-501 - [c27]Piotr Faliszewski, Piotr Skowron, Nimrod Talmon:
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. AAMAS 2017: 6-14 - [c22]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. IJCAI 2017: 192-198 - [c20]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. SAGT 2017: 80-92 - [i19]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. CoRR abs/1707.01417 (2017) - [i18]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting. CoRR abs/1709.02850 (2017) - [i13]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
The Complexity of Multiwinner Voting Rules with Variable Number of Winners. CoRR abs/1711.06641 (2017) - 2016
- [j4]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. J. Artif. Intell. Res. 55: 603-652 (2016) - [c18]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives. AAAI 2016: 482-488 - [c17]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. AAAI 2016: 2452-2458 - [c16]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving Fully Proportional Representation by Clustering Voters. AAMAS 2016: 296-304 - [c14]Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon:
Voting-Based Group Formation. IJCAI 2016: 243-249 - [c13]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Classification and Hierarchy. IJCAI 2016: 250-256 - [i11]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. CoRR abs/1601.01492 (2016) - [i10]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives. CoRR abs/1602.08687 (2016) - [i9]Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Modeling Representation of Minorities Under Multiwinner Voting Rules. CoRR abs/1604.02364 (2016) - 2015
- [j2]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial voter control in elections. Theor. Comput. Sci. 589: 99-120 (2015) - [c11]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. AAAI 2015: 2045-2051 - [c10]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT 2015: 414-431 - [c9]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS 2015: 67-75 - 2014
- [c2]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. MFCS (2) 2014: 153-164 - [i5]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. CoRR abs/1406.6859 (2014) - [i4]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. CoRR abs/1411.7812 (2014)
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-09-21 02:36 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:
