Krzysztof Sornat

Orcid: 0000-0001-7450-4269

Affiliations:
  • IDSIA (Dalle Molle Institute for Artificial Intelligence), Lugano, Switzerland


According to our database1, Krzysztof Sornat authored at least 21 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Complexity of Subelection Isomorphism Problems.
J. Artif. Intell. Res., 2024

Aggregation of Continuous Preferences in One Dimension.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

An O(loglog n)-Approximation for Submodular Facility Location.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Fine-Grained Liquid Democracy for Cumulative Ballots.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Diversity, Agreement, and Polarization in Elections.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
How to Sample Approval Elections?
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Preserving Consistency for Liquid Knapsack Voting.
Proceedings of the Multi-Agent Systems - 19th European Conference, 2022

2021
Inequity aversion pricing over social networks: Approximation algorithms and hardness results.
Theor. Comput. Sci., 2021

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.
Theory Comput. Syst., 2021

Approximation and hardness of Shift-Bribery.
Artif. Intell., 2021

Fine-Grained Complexity and Algorithms for the Schulze Voting Method.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Participatory Budgeting with Project Groups.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Tight Approximation for Proportional Approval Voting.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Participatory Budgeting with Project Interactions.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2018
Approximation and Parameterized Complexity of Minimax Approval Voting.
J. Artif. Intell. Res., 2018

Constant-factor approximation for ordered k-median.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Proportional Approval Voting, Harmonic k-median, and Negative Association.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2014
PTAS for Minimax Approval Voting.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014


  Loading...