MétaCan
Menu
Back to cohort
Record W1607437302 · doi:10.1111/poms.12412

Strategic Consumer Cooperation in a Name‐Your‐Own‐Price Channel

2015· article· en· W1607437302 on OpenAlexafffund
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak

Bibliographic record

VenueProduction and Operations Management · 2015
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPoolingBiddingBusinessMicroeconomicsRevenueClubReal-time biddingExploitMarketingEconomicsFinanceComputer scienceComputer security

Abstract

fetched live from OpenAlex

Supplier reluctance to openly advertise highly discounted products on the Internet has stimulated development of “opaque” name‐Your‐Own‐Price sales channels. Unfortunately (for suppliers), there is significant potential for online consumers to exploit these channels through collaboration in social networks. In this paper, we study three possible forms of consumer collaboration: exchange of bid result information, coordinated bidding, and coordinated bidding with risk pooling. We propose an egalitarian total utility maximizing mechanism for coordination and risk pooling in a bidding club and describe characteristics of consumers for whom participation in the club makes sense. We show that, in the absence of risk pooling, a plausible bidding club strategy using just information exchange gives almost the same benefits to consumers as coordinated bidding. In contrast, coordinated bidding with risk pooling can lead to significantly increased benefits for consumers. The benefits of risk pooling are highest for consumers with a low tolerance to risk. We also demonstrate that suppliers that actively adjust for such strategic consumer behavior can reduce the impact on their businesses and, under some circumstances, even increase revenues.

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 imitation

Not 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.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.007
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.195
GPT teacher head0.384
Teacher spread0.189 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations18
Published2015
Admission routes2
Has abstractyes

Explore more

Same venueProduction and Operations ManagementSame topicAuction Theory and ApplicationsFrench-language works237,207