Author of the publication

Approximation Algorithms for BalancedCC Multiwinner Rules.

, , , and . AAMAS, page 494-502. International Foundation for Autonomous Agents and Multiagent Systems, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Talmon, Nimrod
add a person with the name Talmon, Nimrod
 

Other publications of authors with the same name

NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting., and . Inf. Process. Lett., 116 (2): 147-152 (2016)The Complexity of Finding Effectors., , , , and . Theory Comput. Syst., 60 (2): 253-279 (2017)Large-Scale Election Campaigns: Combinatorial Shift Bribery., , , and . AAMAS, page 67-75. ACM, (2015)A Framework for Approval-based Budgeting Methods., and . CoRR, (2018)On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem., , and . CoRR, (2017)Elections with Few Voters: Candidate Control Can Be Easy., , , and . CoRR, (2014)Foundation for Genuine Global Identities., , and . CoRR, (2019)Modeling Representation of Minorities Under Multiwinner Voting Rules., , , , , and . CoRR, (2016)Robustness Among Multiwinner Voting Rules., , , , , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 80-92. Springer, (2017)Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 558-567. Springer, (2012)