Optimization of Scoring Rules

07/06/2020
by   Jason D. Hartline, et al.
0

This paper introduces an objective for optimizing proper scoring rules. The objective is to maximize the increase in payoff of a forecaster who exerts a binary level of effort to refine a posterior belief from a prior belief. In this framework we characterize optimal scoring rules in simple settings, give efficient algorithms for computing optimal scoring rules in complex settings, and identify simple scoring rules that are approximately optimal. In comparison, standard scoring rules in theory and practice – for example the quadratic rule, scoring rules for the expectation, and scoring rules for multiple tasks that are averages of single-task scoring rules – can be very far from optimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2022

Scoring Rules for Performative Binary Prediction

We construct a model of expert prediction where predictions can influenc...
research
07/15/2021

Optimal Scoring Rule Design

This paper introduces an optimization problem for proper scoring rule de...
research
11/07/2022

Optimal Scoring Rules for Multi-dimensional Effort

This paper develops a framework for the design of scoring rules to optim...
research
02/25/2020

Binary Scoring Rules that Incentivize Precision

All proper scoring rules incentivize an expert to predict accurately (re...
research
05/07/2021

An Objective Prior from a Scoring Rule

In this paper we introduce a novel objective prior distribution levering...
research
04/08/2013

The PAV algorithm optimizes binary proper scoring rules

There has been much recent interest in application of the pool-adjacent-...
research
03/14/2022

Quantum Information Elicitation

In the classic scoring rule setting, a principal incentivizes an agent t...

Please sign up or login with your details

Forgot password? Click here to reset