Title
Contestability in Algorithmic Systems
Abstract
As algorithmic (and particularly machine learning) decision making systems become both more widespread and make more important decisions, there are growing concerns about their embedded values and ability to establish legitimacy among decision subjects. We argue that designing for contestability in these systems can assist in surfacing values, aligning system design and use with context, and building legitimacy. However, designing for contestability can be challenging, particularly in systems that are designed to be opaque: systems need to accurately surface embedded values, expose decision making processes in ways that are meaningful for users, support engagement with and allow influence over system performance, and so on. In addition to these technical aspects, designing for contestability may by challenged by the need to protect intellectual property and prevent gaming of the system. In this workshop, we will address goals, audiences, and designs for contestability in algorithmic systems. We hope to develop a taxonomy of contestable systems and understand the value provided by contestability, while bringing together a community to work on this multidisciplinary problem.
Year
DOI
Venue
2019
10.1145/3311957.3359435
Conference Companion Publication of the 2019 on Computer Supported Cooperative Work and Social Computing
Keywords
DocType
ISBN
algorithmic experience, contestability
Conference
978-1-4503-6692-2
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Kristen Vaccaro11157.66
Karrie Karahalios233.74
Deirdre K. Mulligan327121.39
Daniel Kluttz400.34
Tad Hirsch523.09