MétaCan
Menu
Back to cohort
Record W2046987121 · doi:10.3917/riges.281.0010

Partage des coûts et tarification des infrastructures : enjeux, problématique et pertinence

2003· article· fr· W2046987121 on OpenAlexaffvenue
Marcel Boyer, Michel Truchon, Michel Moreaux

Bibliographic record

VenueGestion · 2003
Typearticle
Languagefr
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsUniversité LavalCenter for Interuniversity Research and Analysis on Organizations
Fundersnot available
KeywordsShapley valueBusinessContext (archaeology)Welfare economicsIncentiveValue (mathematics)MicroeconomicsIndustrial organizationComputer scienceEconomicsGame theory

Abstract

fetched live from OpenAlex

Most, if not all, organizations allocate common costs in one way or another among their various components or among their various partners. These common cost sharing problems are becoming increasingly acute as common cost sharing rules are important factors in competitiveness and performance. Although their explicit scientific analysis is already relatively advanced, their application within organizations (companies, alliances or business networks, governments) remains relatively embryonic and often dependent on an ad hoc historical approach, rather than rationally chosen to maximize organizational performance and value. We believe that organizations, broadly defined, would benefit from investing resources in learning common cost sharing methods that are more rigorous, efficient, equitable and incentive-based than those commonly used. We stress the importance of this investment in an economic context where the development of common infrastructures, both private and public, is omnipresent and conditions efficiency gains, which themselves have become the real cornerstone of competitiveness. We briefly present some cost sharing methods (Shapley-Shubik, nucleoli, sequential rule, ECPR, Ramsey-Boiteux, GPC). The study of these methods, which could better enhance the value of common infrastructures, is pursued in greater depth in the other documents in this series. Finally, we show how these methods have been or could be applied to nine problems that represent a much broader set of possible applications. La plupart des organisations, sinon toutes, repartissent d'une maniere ou d'une autre des couts communs entre leurs diverses composantes ou encore entre leurs differents partenaires. Ces problemes de partage de couts communs se posent avec de plus en plus d'acuite car les regles de partage des couts communs sont des facteurs importants de competitivite et de performance. Bien que leur analyse scientifique explicite soit deja relativement avancee, leur application au sein des organisations (entreprises, alliances ou reseaux d entreprises, gouver-nements) reste relativement embryonnaire et souvent tributaire d'une approche historique ad hoc, plutot que rationnellement choisie pour maximiser la performance et la valeur de l'organisation. Nous croyons que les organisations, entendues au sens large, auraient interet a investir des ressources dans l'apprentissage de methodes de partage de couts communs plus rigoureuses, plus efficaces, plus equitables et plus incitatives que celles couramment utilisees. Nous insistons sur l'importance de cet investissement dans un contexte economique ou le developpement d'infrastructures communes, tant privees que publiques, est omnipresent et conditionne les gains d efficacite, devenus eux-memes la veritable pierre angulaire de la com-petitivite. Nous presentons brievement certaines methodes de partage de couts (Shapley-Shubik, nucleole, regle sequentielle, ECPR, Ramsey-Boiteux, GPC). L'etude de ces methodes, susceptibles de mieux valoriser les infrastructures communes, est poursuivie plus en profondeur dans les autres documents de la presente serie. Nous montrons enfin comment ces methodes ont ete ou pourraient etre appliquees a neuf problemes representatifs d'un ensemble beaucoup plus vaste d'applications possibles.

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.004
metaresearch head score (Gemma)0.006
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
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.660
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

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

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.102
GPT teacher head0.388
Teacher spread0.286 · 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.

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

Citations3
Published2003
Admission routes2
Has abstractyes

Explore more

Same venueGestionSame topicAuction Theory and ApplicationsFrench-language works237,207