MétaCan
Menu
Back to cohort
Record W3107505637 · doi:10.1287/mnsc.2020.3752

Managing Reputation Risk in Supply Chains: The Role of Risk Sharing Under Limited Liability

2020· article· en· W3107505637 on OpenAlexaff
Vibhuti Dhingra, Harish Krishnan

Bibliographic record

VenueManagement Science · 2020
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicSupply Chain and Inventory Management
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsReputationProcurementBusinessRisk managementOperational riskLiabilitySupply chainOrder (exchange)Dual (grammatical number)Industrial organizationRisk analysis (engineering)FinanceMarketing

Abstract

fetched live from OpenAlex

When a supplier fails to comply with social and environmental standards, the buyer’s reputation suffers. Reputation costs can typically be very high for the buyer, whereas the supplier’s liability is often limited. Conventional procurement strategies such as dual sourcing mitigate the buyer’s operational risk, but they often do so at the expense of increasing its reputation risk and sourcing costs. In this paper, we propose a risk-sharing contract for managing the buyer’s reputation concerns. We find that by sharing some of the supplier’s operational loss, the buyer may (in some conditions) decrease its reputational risk, but this has to be balanced against an increase in the operational risk. Risk sharing also reduces sourcing costs because the buyer takes on some of the worst-case loss of a wealth-constrained supplier. These results suggest that risk sharing can be superior, as a procurement strategy, to conventional approaches such as dual sourcing or penalty contracts. This is true when reputation and sourcing costs are a significant concern and operational costs are not that high. Under some conditions, the buyer may choose risk sharing even if it increases reputation risk in order to reduce procurement costs. This paper was accepted by Victor Martínez-de-Albéniz, operations management.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.482
Threshold uncertainty score0.712

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.003
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.018
GPT teacher head0.221
Teacher spread0.203 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations52
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueManagement ScienceSame topicSupply Chain and Inventory ManagementFrench-language works237,207