3 citations · 6 across the 15 of their papers we have counts for
19 papers
Outer Diversity of Condorcet Domains
Piotr Faliszewski, Jan Jabrocki, Mateusz Słuszniak +3
A Condorcet domain is a set of rankings over a given candidate set, such that every election that consists only of (an odd number of) votes from the domain has a transitive majorit…
Power in Liquid Democracy: A Network Centrality Approach
Davide Grossi, Andreas Nitsche, Georgios Papasotiropoulos +3
This paper develops a computationally tractable framework for measuring voters' power in collective decision-making platforms that support transitive and suspendable delegations---…
Agreement, Diversity, and Polarization Indices for Approval Elections
Piotr Faliszewski, Jitka Mertlová, Krzysztof Sornat +2
An index is a function that given an election outputs a value between 0 and 1, indicating the extent to which this election has a particular feature. We seek indices that capture a…
Distances Between Top-Truncated Elections of Different Sizes
Piotr Faliszewski, Jitka Mertlová, Pierre Nunn +2
The map of elections framework is a methodology for visualizing and analyzing election datasets. So far, the framework was restricted to elections that have equal numbers of candid…
Diversity of Structured Domains via k-Kemeny Scores
Piotr Faliszewski, Krzysztof Sornat, Stanisław Szufa +1
In the k-Kemeny problem, we are given an ordinal election, i.e., a collection of votes ranking the candidates from best to worst, and we seek the smallest number of swaps of adjace…
Proportional Selection in Networks
Georgios Papasotiropoulos, Oskar Skibski, Piotr Skowron +1
We address the problem of selecting representative nodes from a network, aiming to achieve two objectives: identifying the most influential nodes and ensuring the selection pro…
Method of Equal Shares with Bounded Overspending
Georgios Papasotiropoulos, Seyedeh Zeinab Pishbin, Oskar Skibski +2
In participatory budgeting (PB), voters decide through voting which subset of projects to fund within a given budget. Proportionality in the context of PB is crucial to ensure equa…
Almost Envy-Freeness under Weakly Lexicographic Preferences
Hadi Hosseini, Aghaheybat Mammadov, Tomasz Wąs
In fair division of indivisible items, domain restriction has played a key role in escaping from negative results and providing structural insights into the computational and axiom…
The Squared Kemeny Rule for Averaging Rankings
Patrick Lederer, Dominik Peters, Tomasz Wąs
For the problem of aggregating several rankings into one ranking, Kemeny (1959) proposed two methods: the median rule which selects the ranking with the smallest total swap distanc…
Guide to Numerical Experiments on Elections in Computational Social Choice
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +7
We analyze how numerical experiments regarding elections were conducted within the computational social choice literature (focusing on papers published in the IJCAI, AAAI, and AAMA…
Diversity, Agreement, and Polarization in Elections
Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat +2
We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice…
Fairly Allocating Goods and (Terrible) Chores
Hadi Hosseini, Aghaheybat Mammadov, Tomasz Wąs
We study the fair allocation of mixtures of indivisible goods and chores under lexicographic preferences$\unicode{x2014}$a subdomain of additive preferences. A prominent fairness n…
Distribution of Chores with Information Asymmetry
Hadi Hosseini, Joshua Kavner, Tomasz Wąs +1
A well-regarded fairness notion when dividing indivisible chores is envy-freeness up to one item (EF1), which requires that pairwise envy can be eliminated by the removal of a sing…
Fair Distribution of Delivery Orders
Hadi Hosseini, Shivika Narang, Tomasz Wąs
We initiate the study of fair distribution of delivery tasks among a set of agents wherein delivery jobs are placed along the vertices of a graph. Our goal is to fairly distribute…
Properties of Position Matrices and Their Elections
Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski +4
We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix).…
Understanding Distance Measures Among Elections
Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier +2
Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challengin…
PageRank for Edges: Axiomatic Characterization
Natalia Kucharczuk, Tomasz Was, Oskar Skibski
Edge centrality measures are functions that evaluate the importance of edges in a network. They can be used to assess the role of a backlink for the popularity of a website as well…
An Axiom System for Feedback Centralities
Tomasz Wąs, Oskar Skibski
In recent years, the axiomatic approach to centrality measures has attracted attention in the literature. However, most papers propose a collection of axioms dedicated to one or tw…
Axiomatic Characterization of PageRank
Tomasz Wąs, Oskar Skibski
This paper examines the fundamental problem of identifying the most important nodes in a network. We use an axiomatic approach to this problem. Specifically, we propose six simple…