A Truthful Two-Stage Mechanism for Eliciting Probabilistic Estimates with Unknown Costs
Papakonstantinou, Athanasios, Rogers, Alex, Gerding, Enrico and Jennings, Nick (2008) A Truthful Two-Stage Mechanism for Eliciting Probabilistic Estimates with Unknown Costs. In, In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), Patras, Greece , 448-452.
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||09 May 2008 12:58|
|Last Modified:||23 Mar 2012 08:27|
|Contributors:||Papakonstantinou, Athanasios (Author)
Rogers, Alex (Author)
Gerding, Enrico (Author)
Jennings, Nick (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||0|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)