Nimrod Talmon

Computational Social Choice
Computational Complexity
Analysis of Algorithms

News

I will be presenting a paper titled "Pairwise Liquid Democracy" in IJCAI '18
I will be presenting a paper titled "Opinion Diffusion and Campaigning on Society Graphs" in IJCAI '18
I will be presenting a paper titled "Egalitarian Committee Scoring Rules" in IJCAI '18
A paper titled "Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives" was accepted for publication in Social Choice and Welfare.
I am on the Program Committee of COMSOC '18.
I am on the Program Committee of IJCAI '18.
Together with Piotr Faliszewski and Piotr Skowron,
at IJCAI '18 I will present a tutorial on
``Multiwinner Elections: Applications, Axioms, Algorithms, and Generalizations''
A paper titled ``Can We Create Large k-Cores by Adding Few Edges?'',
co-authored with Rajesh Chitnis,
is accepted to CSR '18

Publications

() [PDF]

Music

Kapara (1)

Kapara (2)

Contact

Nimrod Talmon
Weizmann Institute of Science
Rehovot, Israel
nimrodtalmon77 at gmail dot com

@article{topkjournal,
    author = {Piotr Faliszweski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon},
    title = {Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives},
    where = {Social Choice and Welfare},
    url = {papers/topkjournal.pdf}
}

@article{paths,
  author = {Piotr Faliszweski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon},
  title = {Multiwinner Rules on a Path From k-Borda to Chamberlin-Courant},
  where = {IJCAI '17},
  url = {papers/paths.pdf}
}

@article{banzhaf,
  author = {Edith Elkind, Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon},
  title = {Committee Scoring Rules, Banzhaf Values, and Approximation Algorithms},
  where = {EXPLORE '17},
  url = {papers/banzhaf.pdf}
}

@article{cogsci,
  author = {David Bourgin, Falk Lieder, Daniel Reichman, Nimrod Talmon, Tom Griffiths},
  title = {The Structure of Goal Systems Predicts Human Performance},
  where = {CogSci '17},
  url = {papers/cogsci.pdf}
}

@article{hyperbolicity,
  author = {Till Fluschnik, Christian Komusiewicz, George Mertzios, Andre Nichterlein,
Rolf Niedermeier, Nimrod Talmon},
  title = {When can Graph Hyperbolicity be computed in Linear Time?},
  where = {WADS '17},
  url = {papers/hyperbolicity.pdf}
}

@article{prstreaming,
  author = {Palash Dey, Nimrod Talmon, Otniel van Handel},
  title = {Proportional Representation in Vote Streams},
  where = {AAMAS '17},
  url = {papers/prstreaming.pdf}
}

@article{spr,
  author = {Nimrod Talmon},
  title = {Structured Proportional Representation},
  where = {AAMAS '17},
  url = {papers/spr.pdf}
}

@article{dm1,
  author = {Arnold Filtser, Nimrod Talmon},
  title = {Distributed Monitoring of Election Winners},
  where = {AAMAS '17},
  url = {papers/dm1.pdf}
}

@article{briberymultiwinner,
  author = {Piotr Faliszewski, Piotr Skowron, Nimrod Talmon},
  title = {Bribery as a Measure of Candidate Success:
Complexity Results for Approval-Based Multiwinner Rules},
  where = {AAMAS '17},
  url = {papers/multiwinnerbribery.pdf}
}

@article{doodle1,
  author = {Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon},
  title = {Teams in Online Scheduling Polls: Game-Theoretic Aspects},
  where = {AAAI '17},
  url = {papers/doodle1.pdf}
}

@article{id12,
  author = {Edith Elkind, Piotr Faliszewski, Jean-Francois Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon},
  title = {What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain},
  where = {AAAI '17},
  url = {papers/twod.pdf}
}

@article{contractionjournal,
  author    = {Sepp Hartung,
               Nimrod Talmon},
  title     = {The Complexity of Degree Anonymization by Graph Contractions},
  where     = {Information and Computation '16},
  url = {papers/contractionjournal.pdf}
}

@article{csbjournal,
  author    = {Robert Bredereck,
               Piotr Faliszewski,
               Rolf Niedermeier,
               Nimrod Talmon},
  title     = {Large-Scale Election Campaigns: Combinatorial Shift Bribery},
  where     = {Journal of Artificial Intelligence Research '16},
  url = {papers/csbjournal.pdf}
}

@article{effectorsjournal,
  author    = {Laurent Bulteau,
               Vincent Froese,
               Rolf Niedermeier,
               Nimrod Talmon},
  title     = {The Complexity of Finding effectors},
  where     = {Theory of Computing Systems '16},
  url = {papers/effectorsjournal.pdf}
}

@article{diffusionjournal,
  author    = {Laurent Bulteau,
               Vincent Froese,
               Nimrod Talmon},
  title     = {Multi-Player Diffusion Games on Graph Classes},
  where     = {Internet Mathematics '16},
  url = {papers/diffusionclassesjournal.pdf}
}

@inproceedings{two_edge_cover_generalizations,
  author     = {Robert Bredereck,
			   Nimrod Talmon},
  title      = {NP-Hardness of Two Edge Cover Generalizations with Applications to Control and Bribery for Approval Voting},
  where  = {Information Processing Letters '16},
  url = {papers/twoedgecover.pdf}
}

@article{id13,
  author = {Tomer Ashur, Orr Dunkelman, Nimrod Talmon},
  title = {Breaching the Privacy of Israel's Paper Ballot Voting System},
  where = {E-Vote-ID '16},
  url = {papers/tomer1.pdf}
}

@article{id14,
  author = {Rene van Bevern, Robert Bredereck, Laurent Bulteau,
Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger},
  title = {Precedence-constrained Scheduling Problems Parameterized by Partial Order Width},
  where = {DOOR '16},
  url = {papers/door16.pdf}
}

@article{ii1,
  author = {Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon},
  title = {Achieving Fully Proportional Representation by Clustering Voters},
  where = {AAMAS '16},
  url = {papers/clustercc.pdf}
}

@article{ii2,
  author = {Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon},
  title = {Committee Scoring Rules: Axiomatic Classification and Hierarchy},
  where = {IJCAI '16},
  url = {papers/csrclassification.pdf}
}

@article{ii3,
  author = {Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon},
  title = {Voting-Based Group Formation},
  where = {IJCAI '16},
  url = {papers/teamformation.pdf}
}

@article{committeebribery,
  author = {Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon},
  title = {The Complexity of Shift Bribery in Committee Elections},
  where = {AAAI '16},
  url = {papers/committeebribery.pdf}
}

@article{multiwinnerplurality16,
  author = {Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon},
  title = {Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Views},
  where = {AAAI '16},
  url = {papers/multiwinnerplurality.pdf}
}

@inproceedings{vertex_addition_journal,
  author     = {Robert Bredereck,
	           Vincent Froese,
			   Sepp Hartung,
			   Andre Nichterlein,
			   Rolf Niedermeier,
			   Nimrod Talmon},
  title      = {The Complexity of Degree Anonymization by Vertex Addition},
  where      = {Theoretical Computer Science '15},
  url        = {papers/vertexadditionjournal.pdf}
}

@inproceedings{cintcov,
  author    = {René van Bevern,
	           Jiehua Chen,
			   Falk Hüffner,
			   Stefan Kratsch,
			   Nimrod Talmon,
			   Gerhard J. Woeginger},
  title     = {Approximability and parameterized complexity of multicover by c-intervals},
  where     = {Information Processing Letters '15},
  url       = {papers/cintcov.pdf}
}

@inproceedings{combinatorial_voter_control_journal,
  author    = {Laurent Bulteau,
	           Jiehua Chen,
	           Piotr Faliszewski,
			   Rolf Niedermeier,
			   Nimrod Talmon},
  title     = {Combinatorial Voter Control in Elections},
  where     = {Theoretical Computer Science '15},
  url       = {papers/combinatorialvotercontroljournal.pdf}
}

@article{bobjob17,
  author     = {Danny Hermelin,
	            Judith-Madeleine Kubitza,
				Nimrod Talmon,
				Dvir Shabtay,
			    Gerhard J. Woeginger},
  title      = {Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs},
  where  = {IPEC '15},
  url = {papers/bobjobipec.pdf}
}

@article{anonymizing_elections,
  author     = {Nimrod Talmon},
  title      = {Privacy in Elections: k-Anonymizing Preference Orders},
  where      = {FCT '15},
  url        = {papers/fct15.pdf}
}

@article{weighted_multicover,
  author    = {Robert Bredereck,
               Piotr Faliszewski,
               Rolf Niedermeier,
               Piotr Skowron,
               Nimrod Talmon},
  title     = {Elections with Few Candidates: Prices, Weights, and Covering Problems},
  where     = {ADT '15},
  url       = {papers/adt15.pdf}
}

@article{csb,
  author    = {Robert Bredereck,
               Piotr Faliszewski,
               Rolf Niedermeier,
               Nimrod Talmon},
  title     = {Large-Scale Election Campaigns: Combinatorial Shift Bribery},
  where     = {AAMAS '15},
  url       = {papers/csbconf.pdf}
}

@article{effectors,
  author    = {Laurent Bulteau,
               Stefan Fafianie,
               Vincent Froese,
               Rolf Niedermeier,
               Nimrod Talmon},
  title     = {The Complexity of Finding Effectors},
  where     = {TAMC '15},
  url       = {papers/effectors.pdf}
}

@article{diffusion_games,
  author    = {Laurent Bulteau,
               Vincent Froese,
               Nimrod Talmon},
  title     = {Multi-Player Diffusion Games on Graph Classes},
  where = {TAMC '15},
  url       = {papers/diffusiongames.pdf}
}

@article{graph_contractions,
  author = {Sepp Hartung, Nimrod Talmon},
  title = {The Complexity of Degree Anonymization by Graph Contractions},
  where = {TAMC '15},
  url   = {papers/contractionstamc.pdf}
}

@article{few_voters,
  author    = {Jiehua Chen,
               Piotr Faliszewski,
               Rolf Niedermeier,
               Nimrod Talmon},
  title     = {Elections with Few Voters: Candidate Control Can Be Easy},
  where     = {AAAI '15},
  url       = {papers/fewvotersaaai.pdf}
}

@inproceedings{combinatorial_voter_control,
  author    = {Jiehua Chen,
	           Piotr Faliszewski,
			   Rolf Niedermeier,
			   Nimrod Talmon},
  title     = {Combinatorial Voter Control in Elections},
  where     = {MFCS '14},
  url       = {papers/combvotercontrolmfcs.pdf}
}

@inproceedings{vertex_addition,
  author    = {Robert Bredereck,
	           Vincent Froese,
			   Sepp Hartung,
			   Andre Nichterlein,
			   Rolf Niedermeier,
			   Nimrod Talmon},
  title     = {The Complexity of Degree Anonymization by Vertex Addition},
  where     = {AAIM '14},
  url={papers/aaim14.pdf}
}

@inproceedings{resilient_selection,
  author    = {Tsvi Kopelowitz,
	           Nimrod Talmon},
  title     = {Selection in the Presence of Memory Faults, with Applications to In-Place Resilient Sorting},
  where     = {ISAAC '12},
  url       = {papers/isaac12.pdf}
}