Athanasios Papakonstantinou

dblp:98/4213 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2011
0000-0002-5300-4318ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed coordination
0.112011
Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems · Artif. Intell. 2011
Distributed systems
distributed information systems
0.112011
Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems · Artif. Intell. 2011
Algorithmic game theory and mechanism design › mechanism design › information elicitation
truthful elicitation
0.112011
Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems · Artif. Intell. 2011

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

mechanism design · 0.2
YearPublicationVenuePosition
2011 Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems
Athanasios Papakonstantinou, Alex Rogers, Enrico H. Gerding, Nicholas R. Jennings
Artif. Intell.1
2008 A Truthful Two-Stage Mechanism for Eliciting Probabilistic Estimates with Unknown Costs
abstract
This paper reports on the design of a novel two-stage mechanism, based on strictly proper scoring rules, that motivates selfish rational agents to make a costly probabilistic estimate or forecast of a specified precision and report it truthfully to a centre. Our mechanism is applied in a setting where the centre is faced with multiple agents, and has no knowledge about their costs. Thus, in the first stage of the mechanism, the centre uses a reverse second price auction to allocate the estimation task to the agent who reveals the lowest cost. While, in the second stage, the centre issues a payment based on a strictly proper scoring rule. When taken together, the two stages motivate agents to reveal their true costs, and then to truthfully reveal their estimate. We prove that this mechanism is incentive compatible and individually rational, and then present empirical results comparing the performance of the well known quadratic, spherical and logarithmic scoring rules. We show that the quadratic and the logarithmic rules result in the centre making the highest and the lowest expected payment to agents respectively. At the same time, however, the payments of the latter rule are unbounded, and thus the spherical rule proves to be the best candidate in this setting.
Athanasios Papakonstantinou, Alex Rogers, Enrico H. Gerding, Nicholas R. Jennings
ECAI1