MétaCan
Menu
Back to cohort
Record W2152585623 · doi:10.1109/tpwrs.2003.810676

Reconciling social welfare, agent profits, and consumer payments in electricity pools

2003· article· en· W2152585623 on OpenAlexaff
F.D. Galiana, A.L. Motto, François Bouffard

Bibliographic record

VenueIEEE Transactions on Power Systems · 2003
Typearticle
Languageen
FieldEngineering
TopicElectric Power System Optimization
Canadian institutionsMcGill University
Fundersnot available
KeywordsMicroeconomicsEconomicsRevenueElectricityProfit (economics)Electricity marketMarginal costMarginal profitPaymentTransfer paymentScheduleSocial WelfareWelfareEngineeringMarket economyFinance

Abstract

fetched live from OpenAlex

Under a common condition called profit suboptimality, market equilibrium cannot be reached in electricity pools; in other words, no system marginal price exists for which the profit-driven independent generators would self-schedule to levels that exactly meet the demand. On the other hand, although a centrally imposed generation schedule satisfies power balance, it may force some agents to operate at a profit below what they could achieve under self-scheduling. This paper examines these incompatible goals and proposes a conflict resolution scheme based on the notion of generalized uplift functions. These functions are defined such that they: (i) change the offered generation cost characteristics so as to increase the system marginal price, thus forcing the consumers to compensate the generators for part of their combined loss of profit; (ii) execute an equitable transfer of revenues among the generators so that these also participate in any loss of profit compensation; (iii) ensure market equilibrium at the centralized minimum cost solution; and (iv) ensure that the net sum of the uplifts adds up to zero.

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.005
metaresearch head score (Gemma)0.008
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.005
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0030.005
Open science0.0010.004
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.012
GPT teacher head0.215
Teacher spread0.203 · 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

Citations71
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Power SystemsSame topicElectric Power System OptimizationFrench-language works237,207