Demo Data from SIGIR 2026 / reviewers in the wild / expert
William Fan
dblp:263/9924
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › social choice
participatory budgeting |
0.4 | 1 | 2020 | Concentration of Distortion: The Value of Extra Voters in Randomized Social Choice · IJCAI 2020 |
Algorithmic game theory and mechanism design › social choice
randomized social choice |
0.4 | 1 | 2020 | Concentration of Distortion: The Value of Extra Voters in Randomized Social Choice · IJCAI 2020 |
Algorithmic game theory and mechanism design
social choice |
0.4 | 1 | 2020 | Concentration of Distortion: The Value of Extra Voters in Randomized Social Choice · IJCAI 2020 |
Methods — techniques the papers use, named apart from their topics
statistical moment analysis · 0.4sampling · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Concentration of Distortion: The Value of Extra Voters in Randomized Social ChoiceabstractWe study higher statistical moments of Distortion for randomized social choice in a metric implicit utilitarian model. The Distortion of a social choice mechanism is the expected approximation factor with respect to the optimal utilitarian social cost (OPT). The k'th moment of Distortion is the expected approximation factor with respect to the k'th power of OPT. We consider mechanisms that elicit alternatives by randomly sampling voters for their favorite alternative. We design two families of mechanisms that provide constant (with respect to the number of voters and alternatives) k'th moment of Distortion using just k samples if all voters can then participate in a vote among the proposed alternatives, or 2k-1 samples if only the sampled voters can participate. We also show that these numbers of samples are tight. Such mechanisms deviate from a constant approximation to OPT with probability that drops exponentially in the number of samples, independent of the total number of voters and alternatives. We conclude with simulations on real-world Participatory Budgeting data to qualitatively complement our theoretical insights. Brandon Fain, William Fan, Kamesh Munagala |
IJCAI | 2 |