NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (27)

cs.MA2019

Sybil-Resilient Reality-Aware Social Choice

Gal Shahaf, Ehud Shapiro, Nimrod Talmon

cs.GT2018

Committee Scoring Rules: Axiomatic Characterization and Hierarchy

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko +1

cs.DS2017

Balanced Facilities on Random Graphs

Roee David, Nimrod Talmon

cs.DS2017

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems

Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay +2

cs.GT2018

A Participatory Democratic Budgeting Algorithm

Ehud Shapiro, Nimrod Talmon

cs.AI2017

Elections with Few Voters: Candidate Control Can Be Easy

Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier +1

cs.AI2018

Complexity of Shift Bribery in Committee Elections

Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +1

cs.GT2016

Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko +1

cs.GT2017

The Complexity of Multiwinner Voting Rules with Variable Number of Winners

Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon

cs.GT2019

Distributed Monitoring of Election Winners

Arnold Filtser, Nimrod Talmon

cs.GT2017

Multi-Player Diffusion Games on Graph Classes

Laurent Bulteau, Vincent Froese, Nimrod Talmon

cs.CY2019

Reality-Aware Social Choice

Ehud Shapiro, Nimrod Talmon

cs.CR2016

Breaching the Privacy of Israel's Paper Ballot Voting System

Tomer Ashur, Orr Dunkelman, Nimrod Talmon

cs.DS2017

On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem

Danny Hermelin, Dvir Shabtay, Nimrod Talmon

cs.GT2019

Robustness Among Multiwinner Voting Rules

Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk +3

cs.CC2017

When can Graph Hyperbolicity be computed in Linear Time?

Till Fluschnik, Christian Komusiewicz, George B. Mertzios +3

cs.DS2012

Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting

Tsvi Kopelowitz, Nimrod Talmon

cs.GT2017

Proportional Representation in Vote Streams

Palash Dey, Nimrod Talmon, Otniel van Handel

cs.DS2015

The Complexity of Finding Effectors

Laurent Bulteau, Stefan Fafianie, Vincent Froese +2

cs.AI2018

A Framework for Approval-based Budgeting Methods

Piotr Faliszewski, Nimrod Talmon

cs.GT2017

Proportionally Representative Participatory Budgeting: Axioms and Algorithms

Haris Aziz, Barton Lee, Nimrod Talmon

cs.DS2017

Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting

Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +2

cs.GT2016

Teams in Online Scheduling Polls: Game-Theoretic Aspects

Robert Bredereck, Jiehua Chen, Rolf Niedermeier +2

math.OC2016

Precedence-constrained scheduling problems parameterized by partial order width

René van Bevern, Robert Bredereck, Laurent Bulteau +3

cs.GT2019

What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain

Edith Elkind, Piotr Faliszewski, Jean-Francois Laslier +3

cs.GT2016

Modeling Representation of Minorities Under Multiwinner Voting Rules

Piotr Faliszewski, Jean-Francois Laslier, Robert Schaefer +3

cs.MA2014

Combinatorial Voter Control in Elections

Laurent Bulteau, Jiehua Chen, Piotr Faliszewski +2