Revenue sharing bids of a loss-averse supplier for a new product development contract: a multi-method investigation
Bibliographic record
Abstract
Purpose When developing a new product, a buying firm solicits revenue sharing bids from two competing suppliers. Bidding behaviors of suppliers do not always align with predictions from rational agent models due to task uncertainty and bounded rationality, which could result in non-optimal supplier offers and ultimately hurt buying firm interests. This paper aims to discuss the aforementioned issues. Design/methodology/approach The authors built an analytical model that considers the impact of supplier technological risk, buyer–supplier coordination cost and supplier loss aversion on the optimal bid of the supplier. Next, using limited information processing capacity as a theoretic lens, the authors explore antecedents to the size of a focal supplier's bidding error, the absolute difference between the actual bid and the optimal bid. The authors used quantitative lab experimental data to test the hypotheses. Findings (1) Bounded rational bidders often fail to differentiate between relevant and irrelevant competitive information when placing bids, (2) loss aversion of a bidder significantly affects not only levels of bids, particularly for bidders with competitive disadvantages, but also sizes of the bidding error and (3) competitive information that has clearer performance implications are more influential in reducing sizes of bidding errors. Originality/value The results provide a comprehensive view of the bidding behaviors of a bounded rational supplier in an innovation outsourcing context with competition. With the results, managers now have a better understanding of behavioral influencers behind non-optimal supplier bids in an innovation outsourcing context.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.018 | 0.060 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".