The Query Complexity of Scoring Rules

Abstract

Proper scoring rules are crucial tools to elicit truthful information from experts. A scoring rule maps X, an expert-provided distribution over the set of all possible states of the world, and ω , a realized state of the world, to a real number representing the expert’s reward for his provided information. To compute this reward, a scoring rule queries the distribution X at various states. The number of these queries is thus a natural measure of the complexity of the scoring rule.

Document Details

Document Type
Pub Defense Publication
Publication Date
Jul 01, 2014
Source ID
10.1145/2632228

Entities

People

  • Pablo Daniel Azar
  • Silvio Micali

Organizations

  • Massachusetts Institute of Technology
  • Office of Naval Research

Tags

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.