World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Poland
2026

D-Index & Metrics

Computer Science

D-Index
47
Citations
6567
World Ranking
6617
National Ranking
11

Research.com Recognitions

  • 2026 - Research.com Computer Science in Poland Leader Award
  • 2025 - Research.com Computer Science in Poland Leader Award
  • 2022 - Research.com Computer Science in Poland Leader Award

Overview

Piotr Faliszewski is affiliated with AGH University of Science and Technology in Poland. Their research spans several main fields, including Computer Science and Economics, Econometrics, and Finance. Within these areas, their work covers a variety of subfields such as Economics and Econometrics, Computational Theory and Mathematics, Management Science and Operations Research, Artificial Intelligence, and Political Science and International Relations.

The scientist's research primarily focuses on topics related to Game Theory and Voting Systems, which accounts for the most extensive part of their work. Other significant topics include Auction Theory and Applications, Complexity and Algorithms in Graphs, Internet Traffic Analysis and Secure E-voting, Advanced Graph Theory Research, Electoral Systems and Political Participation, and Opinion Dynamics and Social Influence.

Piotr Faliszewski has contributed to numerous papers published in notable venues. Selected recent papers include:

  • Robustness among multiwinner voting rules, 2020, Lecture notes in computer science
  • An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • Possible Winners in Noisy Elections, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting, 2020, Theoretical Computer Science
  • Parameterized Algorithms for Finding a Collective Set of Items, 2020, Proceedings of the AAAI Conference on Artificial Intelligence

Their frequent publication venues reflect their engagement with both theoretical and applied aspects of their research, including arXiv (Cornell University), Proceedings of the AAAI Conference on Artificial Intelligence, Lecture notes in computer science, Theoretical Computer Science, and Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.

Collaboration is a significant aspect of their academic work. Frequent co-authors include Stanisław Szufa, Niclas Boehmer, Nimrod Talmon, Łukasz Janeczko, and Robert Bredereck. These collaborations span across various papers and projects within their fields of expertise.

Best Publications

  • How hard is bribery in elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Properties of multiwinner voting rules.

    Edith Elkind;Piotr Faliszewski;Piotr Skowron;Arkadii Slinko

  • Llull and Copeland voting computationally resist bribery and constructive control

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

  • Multiwinner Voting: A New Challenge for Social Choice Theory

    P Faliszewski;Arkadii Slinko;N Talmon

  • AI’s War on Manipulation: Are We Winning?

    Piotr Faliszewski;Ariel D. Procaccia

  • Using complexity to protect elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Finding a collective set of items: from proportional multirepresentation to group recommendation

    Piotr Skowron;Piotr Faliszewski;Jerome Lang

  • Control and Bribery in Voting

    Piotr Faliszewski;Jörg Rothe

  • Multimode control attacks on elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • The shield that never was: Societies with single-peaked preferences are more open to manipulation and control

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

  • Swap Bribery

    Edith Elkind;Piotr Faliszewski;Arkadii Slinko

  • A Richer Understanding of the Complexity of Election Systems

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Joerg Rothe

  • Achieving fully proportional representation

    Piotr Skowron;Piotr Faliszewski;Arkadii Slinko

  • Copeland voting: ties matter

    Piotr Faliszewski;Edith Hemaspaandra;Henning Schnoor

  • The complexity of bribery in elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • The complexity of manipulative attacks in nearly single-peaked electorates

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Prices matter for the parameterized complexity of shift bribery

    Robert Bredereck;Jiehua Chen;Piotr Faliszewski;André Nichterlein

  • Finding a collective set of items

    Piotr Skowron;Piotr Faliszewski;Jrme Lang

  • Manipulating the quota in weighted voting games

    Michael Zuckerman;Piotr Faliszewski;Yoram Bachrach;Edith Elkind

  • Campaigns for lazy voters: truncated ballots

    Dorothea Baumeister;Piotr Faliszewski;Jérôme Lang;Jörg Rothe

  • Achieving Fully Proportional Representation: Approximability Results

    Piotr Skowron;Piotr Faliszewski;Arkadii Slinko

Frequent Co-Authors

Edith Elkind
Edith Elkind University of Oxford
Lane A. Hemaspaandra
Lane A. Hemaspaandra University of Rochester
Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin
Edith Hemaspaandra
Edith Hemaspaandra Rochester Institute of Technology
Jörg Rothe
Jörg Rothe Heinrich Heine University Düsseldorf
Yoram Bachrach
Yoram Bachrach DeepMind (United Kingdom)
Jérôme Lang
Jérôme Lang Paris Dauphine University
Haris Aziz
Haris Aziz University of New South Wales
Ariel D. Procaccia
Ariel D. Procaccia Harvard University
Vincent Conitzer
Vincent Conitzer Carnegie Mellon University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options is an excellent way to start or advance your career in computer science or related fields. For those seeking the quickest route into the workforce, online associate degree programs offer fast-track paths. These programs can often be completed in as little as six months and provide foundational skills in technology and programming.

If you're considering graduate studies, affordability becomes a key issue. There are several cheapest doctorate degree online options available for those looking to earn the highest academic credentials without excessive costs. Education professionals may benefit from cheapest online edd programs, which allow you to achieve an Ed.D. efficiently and affordably.

For those interested in combining tech skills with business acumen, you’ll want to research online business degree cost options. Affordable business degrees can complement your computer science background and open up a diverse range of career pathways in management, entrepreneurship, and tech leadership.

Best Scientists Citing Piotr Faliszewski

Trending Scientists