Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Estelle Varloot

dblp:286/1601 · also Estelle Marine Varloot · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › social choice
belief aggregation
0.612022
Level-strategyproof Belief Aggregation Mechanisms · EC 2022
Algorithmic game theory and mechanism design
mechanism design
0.612022
Level-strategyproof Belief Aggregation Mechanisms · EC 2022
Algorithmic game theory and mechanism design
social choice
0.612022
Level-strategyproof Belief Aggregation Mechanisms · EC 2022
Algorithmic game theory and mechanism design › mechanism design › incentive compatibility
strategyproofness
0.612022
Level-strategyproof Belief Aggregation Mechanisms · EC 2022
Algorithmic game theory and mechanism design › social choice
voting
0.212022
Level-strategyproof Belief Aggregation Mechanisms · EC 2022

Methods — techniques the papers use, named apart from their topics

axiomatic characterization · 0.6
YearPublicationVenuePosition
2022 Level-strategyproof Belief Aggregation Mechanisms
abstract
In the problem of aggregating experts' probabilistic predictions or opinions over an ordered set of outcomes, we introduce the axiom of level-strategyproofness (level-SP) and argue that it is natural in several real-life applications and robust as a notion. It implies truthfulness in a rich domain of single-peaked preferences over the space of cumulative distributions. This contrasts with the existing literature, where we usually assume single-peaked preferences over the space of probability distributions instead. Our main results are (1) explicit characterizations of all level-SP methods with and without the addition of other axioms (certainty preservation, plausibility preservation, proportionality); (2) comparisons and axiomatic characterizations of two new and practical level-SP methods: the proportional-cumulative and the middlemost-cumulative; (3) an application of the proportional-cumulative to construct a new voting method that extends majority judgment and where voters can express their uncertainties/doubts about the merits/qualities of the candidates/alternatives to be ranked.
Estelle Varloot, Rida Laraki
EC1