CoChat

Understanding the Effect that Task Complexity has on Automation Potential and Opacity: Implications for Algorithmic Fairness

Open access
Indian Institute of Management Tiruchirappalli, Vimalkumar, M., Gupta, Agam, Indian Institute of Technology Delhi, Sharma, Divya, OP Jindal Global University, Dwivedi, Yogesh K., Swansea University · 2021 · AIS Transactions on Human-Computer Interaction
Cited by 43

The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.

Abstract

Scholars have increasingly focused on understanding different aspects of algorithms since they not only affect individual choices and decisions but also influence and shape societal structures. We can broadly categorize scholarly work on algorithms along the dimensions of economic gain that one achieves through automation and the ethical concerns that stem from such automation. However, the literature largely uses the notion of algorithms in a generic way and overlooks different algorithms’ specificity and the type of tasks that they perform. Drawing on a typology of tasks based on task complexity, we suggest that variations in the complexity of tasks contribute to differences in 1) their automation potential and 2) the opacity that results from their automation. We also suggest a framework to assess the likelihood that fairness concerns will emanate from automation of tasks with varying complexity. In this framework, we also recommend affordances for addressing fairness concerns that one may design into systems that automate different types of tasks.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.17705/1thci.00144

Cites

45 of 45 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 45 references

Cited by

See all 43

Metadata

Authors
Indian Institute of Management Tiruchirappalli, Vimalkumar, M., Gupta, A., Indian Institute of Technology Delhi, Sharma, D., OP Jindal Global University, Dwivedi, Y. K., & Swansea University
Venue
AIS Transactions on Human-Computer Interaction
Published
2021-03-31
Pages
104-129
ISSN
1944-3900 (ISSN-L)
OpenAlex
W3123095187
Cited by
43
References
45
FWCI
9.89
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Understanding the Effect that Task Complexity has on Automation Potential and Opacity: Implications for Algorithmic Fairness. https://app.cochat.ai/papers/10.17705/1thci.00144
The paper
Indian Institute of Management Tiruchirappalli, Vimalkumar, M., Gupta, A., Indian Institute of Technology Delhi, Sharma, D., OP Jindal Global University, Dwivedi, Y. K., & Swansea University. (2021). Understanding the Effect that Task Complexity has on Automation Potential and Opacity: Implications for Algorithmic Fairness. AIS Transactions on Human-Computer Interaction. https://doi.org/10.17705/1thci.00144

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.