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

Sonja Radas

dblp:98/4355 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-2168-6772ORCID · reported

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

Theory of computation · 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 · 61% Logic in computer science · 30% Information theory · 9%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › meta-logic
axiomatization
0.412019
Game of Duels: Information-Theoretic Axiomatization of Scoring Rules · IEEE Trans. Inf. Theory 2019
Algorithmic game theory and mechanism design › mechanism design › information elicitation
bayesian truth serum
0.412019
Game of Duels: Information-Theoretic Axiomatization of Scoring Rules · IEEE Trans. Inf. Theory 2019
Algorithmic game theory and mechanism design › social choice › voting
scoring rules
0.412019
Game of Duels: Information-Theoretic Axiomatization of Scoring Rules · IEEE Trans. Inf. Theory 2019
Information theory › information measures
entropy
0.112019
Game of Duels: Information-Theoretic Axiomatization of Scoring Rules · IEEE Trans. Inf. Theory 2019

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

axiomatic method · 0.4
YearPublicationVenuePosition
2019 Game of Duels: Information-Theoretic Axiomatization of Scoring Rules
abstract
This paper aims to develop the insights into Bayesian truth serum (BTS) mechanism by postulating a sequence of seven natural conditions reminiscent of axioms in information theory. The condition that reduces a larger family of mechanisms to BTS is additivity, akin to the axiomatic development of entropy. The seven conditions identify BTS as the unique scoring rule for ranking respondents in situations in which respondents are asked to choose an alternative from a finite set and provide predictions of their peers' propensities to choose, for finite or infinite sets of respondents.
Jaksa Cvitanic, Drazen Prelec, Sonja Radas, Hrvoje Sikic
IEEE Trans. Inf. Theory3