An Axiomatic Approach to Formalized Responsibility Ascription

11/12/2021
by   Sarah Hiller, et al.
0

Quantified responsibility ascription in complex scenarios is of crucial importance in current debates regarding collective action, for example in the face of various environmental crises. Within this endeavor, we recently proposed considering a probabilistic view of causation, rather than the deterministic views employed in much of the previous formal responsibility literature, and presented a corresponding framework as well as initial candidate functions applicable to a range of scenarios. In the current paper, we extend this contribution by formally evaluating the qualities of proposed functions through an axiomatic approach. First, we decompose responsibility ascription into distinct contributing functions, before defining a number of desirable properties, or axioms, for these. Afterwards we evaluate the proposed functions regarding compliance with these axioms. We find an incompatibility between axioms determining upper and lower bounds in one of the contributing functions, imposing a choice for one variant - upper bound or lower bound. For the other contributing function we are able to axiomatically characterize one specific function. As the previously mentioned incompatibility extends to the combined responsibility function we finally present maximally axiom compliant combined functions for each variant - including the upper bound axiom or including the lower bound axiom.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2020

A Note on John Simplex with Positive Dilation

We prove a Johns theorem for simplices in R^d with positive dilation fac...
research
05/11/2023

Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel

The binary deletion channel with deletion probability d (BDC_d) is a ran...
research
01/27/2021

A Note on the Representation Power of GHHs

In this note we prove a sharp lower bound on the necessary number of nes...
research
10/12/2022

Bounds on the Wireless MapReduce NDT-Computation Tradeoff

We consider a full-duplex wireless Distributed Computing (DC) system und...
research
06/21/2021

Machine Learning based optimization for interval uncertainty propagation with application to vibro-acoustic models

Two non-intrusive uncertainty propagation approaches are proposed for th...
research
11/27/2018

Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions

To determine the dimension of null space of any given linearized polynom...
research
04/20/2018

On the Location of the Minimizer of the Sum of Two Strongly Convex Functions

The problem of finding the minimizer of a sum of convex functions is cen...

Please sign up or login with your details

Forgot password? Click here to reset