MétaCan
Menu
Back to cohort
Record W2938787618 · doi:10.34989/swp-2016-63

Information Sharing and Bargaining in Buyer-Seller Networks

2021· article· en· W2938787618 on OpenAlexaff
Sofia Priazhkina, Frank H. Page

Bibliographic record

VenueEconstor (Econstor) · 2021
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsBank of Canada
Fundersnot available
KeywordsBusinessInformation sharingInformation exchangeMicroeconomicsWelfareInformation asymmetryIndustrial organizationCommerceEconomicsComputer scienceTelecommunicationsMarket economy

Abstract

fetched live from OpenAlex

This paper presents a model of strategic buyer-seller networks with information exchange between sellers. Prior to engaging in bargaining with buyers, sellers can share access to buyers for a negotiated transfer. We study how this information exchange affects overall market prices, volumes and welfare, given different initial market conditions and information sharing rules. In markets with homogeneous traders, sharing always increases total trade volume. The market reaches Walrasian trade volume when there are more buyers than sellers or when sellers have more bargaining power. In most cases, market surplus is completely reallocated to sellers. In the markets with heterogeneous traders, sharing may either increase or decrease total trade volume. When sellers have more bargaining power than buyers, information exchange leads to trade above the Walrasian level, thus leaving inefficiency only due to overproduction of high-cost sellers. As a result of information sharing, the buyers who value goods the least will be squeezed out from the market independent of their location and bargaining power. We also show that if, together with information exchange, sellers assign property rights on the information, exchange leads to lower volume and market prices than exchange without property rights.

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.004
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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.047

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.010
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0020.003
Scholarly communication0.0040.008
Open science0.0020.002
Research integrity0.0040.002
Insufficient payload (model declined to judge)0.0140.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.038
GPT teacher head0.303
Teacher spread0.265 · 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 designTheoretical or conceptual
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

Citations0
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueEconstor (Econstor)Same topicAuction Theory and ApplicationsFrench-language works237,207