MétaCan
Menu
Back to cohort
Record W2890642102 · doi:10.17705/1jais.00505

Pricing in C2C Sharing Platforms

2018· article· en· W2890642102 on OpenAlexaff
Steffen Zimmermann, Peter Angerer, Daniel Provin, Barrie R. Nault

Bibliographic record

VenueJournal of the Association for Information Systems · 2018
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicSharing Economy and Platforms
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsOrder (exchange)Sharing economyBusinessMonopolyClearingDurable goodDatabase transactionMarket sharePricing strategiesIndustrial organizationMicroeconomicsCommerceEconomicsMarketingFinanceComputer science

Abstract

fetched live from OpenAlex

Sharing platforms such as zilok.com enable sharing of durable goods among consumers, and seek to maximize profits by charging transaction-based platform fees. We develop a model in which consumers who have heterogeneous needs concerning the use of a durable good decide whether to purchase and share (i.e., be a lender) or borrow (i.e., be a borrower), and a monopoly sharing platform determines the platform fees. We find, first, that consumers with greater need to use a durable good purchase and share, and that consumers with lesser need borrow. Second, sharing platforms maximize profits only if the supply of a durable good matches demand—that is, the market must clear in order for platform fees to be profit maximizing. Third, the market-clearing condition requires lender and borrower fees are classic strategic complements. Fourth, to maintain the market-clearing condition, sharing platforms have to increase their lender fee or decrease their borrower fee in response to increases in the sharing price, increases in usage capacity, and decreases in the purchase price of a durable good, and vice versa. These findings indicate that commonly applied one-sided pricing models in sharing platforms can be improved.

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.002
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.016
Threshold uncertainty score0.052

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0020.003
Scholarly communication0.0050.010
Open science0.0030.003
Research integrity0.0040.002
Insufficient payload (model declined to judge)0.0160.002

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.219
Teacher spread0.201 · 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 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

Citations14
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueJournal of the Association for Information SystemsSame topicSharing Economy and PlatformsFrench-language works237,207