Tomasz Wąs
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Interests
Tomasz Wąs has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Oskar Skibski
University of Warsaw, Warsaw, Poland
2 shared publications - Dominik Peters
CNRS, LAMSADE, Université Paris Dauphine-PSL, Paris, France
1 shared publication - Georgios Papasotiropoulos
University of Warsaw, Warsaw, Poland
1 shared publication - Hadi Hosseini
Pennsylvania State University, University Park, PA, USA
1 shared publication Oskar Skibski
1 shared publication- Patrick Lederer
University of New South Wales, Sydney, Australia
1 shared publication
Latest Publications
- Open Access
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 841-868
Method of Equal Shares with Bounded Overspending
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 841-868
Open AccessMethod of Equal Shares with Bounded Overspending
- Open Access
- 27 June 2025
- Published by Elsevier in Artificial Intelligence
- Vol. 347
Fair distribution of delivery orders
- 27 June 2025
- Published by Elsevier in Artificial Intelligence
- Vol. 347
Open AccessFair distribution of delivery orders
- Open Access
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 755
The Squared Kemeny Rule for Averaging Rankings
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 distance to the input rankings, and the mean rule which minimizes the squared swap distances to the input rankings. The median rule has been extensively studied since and is now known simply as Kemeny's rule. It exhibits majoritarian properties, so for example if more than half of the input rankings are the same, then the output of the rule is the same ranking. We observe that this behavior is undesirable in many rank aggregation settings. For example, when we rank objects by different criteria (quality, price, etc.) and want to aggregate them with specified weights for the criteria, then a criterion with weight 51% should have 51% influence on the output instead of 100%. We show that the Squared Kemeny rule (i.e., the mean rule) behaves this way, by establishing a bound on the distance of the output ranking to any input rankings, as a function of their weights. Furthermore, we give an axiomatic characterization of the Squared Kemeny rule, which mirrors the existing characterization of the Kemeny rule but replaces the majoritarian Condorcet axiom by a proportionality axiom. Finally, we discuss the computation of the rule and show its behavior in a simulation study.
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 755
Open AccessThe Squared Kemeny Rule for Averaging Rankings
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 distance to the input rankings, and the mean rule which minimizes the squared swap distances to the input rankings. The median rule has been extensively studied since and is now known simply as Kemeny's rule. It exhibits majoritarian properties, so for example if more than half of the input rankings are the same, then the output of the rule is the same ranking. We observe that this behavior is undesirable in many rank aggregation settings. For example, when we rank objects by different criteria (quality, price, etc.) and want to aggregate them with specified weights for the criteria, then a criterion with weight 51% should have 51% influence on the output instead of 100%. We show that the Squared Kemeny rule (i.e., the mean rule) behaves this way, by establishing a bound on the distance of the output ranking to any input rankings, as a function of their weights. Furthermore, we give an axiomatic characterization of the Squared Kemeny rule, which mirrors the existing characterization of the Kemeny rule but replaces the majoritarian Condorcet axiom by a proportionality axiom. Finally, we discuss the computation of the rule and show its behavior in a simulation study.
- 7 March 2023
- Published by Elsevier in Artificial Intelligence
- Vol. 318
Axiomatic characterization of PageRank
- 7 March 2023
- Published by Elsevier in Artificial Intelligence
- Vol. 318
Axiomatic characterization of PageRank
- Open Access
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 3898-3904
Axiomatization of the PageRank Centrality
We propose an axiomatization of PageRank. Specifically, we introduce five simple axioms—Foreseeability, Outgoing Homogeneity, Monotonicity, Merging, and Dummy Node—and show that PageRank is the only centrality measure that satisfies all of them. Our axioms give a new conceptual and theoretical underpinnings of PageRank and show how it differs from other centralities.
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 3898-3904
Open AccessAxiomatization of the PageRank Centrality
We propose an axiomatization of PageRank. Specifically, we introduce five simple axioms—Foreseeability, Outgoing Homogeneity, Monotonicity, Merging, and Dummy Node—and show that PageRank is the only centrality measure that satisfies all of them. Our axioms give a new conceptual and theoretical underpinnings of PageRank and show how it differs from other centralities.