{"id":"W2099975670","doi":"10.1109/tpwrs.2009.2037153","title":"Fast Computation of Pure Strategy Nash Equilibria in Electricity Markets Cleared by Merit Order","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Power Systems","topic":"Electric Power System Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Clearance; Nash equilibrium; Oligopoly; Electricity market; Mathematical optimization; Constant (computer programming); Block (permutation group theory); Computation; Market power; Order (exchange); Integer programming; Electricity; Linear programming; Computer science; Mathematical economics; Economics; Mathematics; Microeconomics; Engineering; Algorithm; Monopoly; Electrical engineering; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001326841,0.0008189603,0.001112568,0.0006959152,0.0006547428,0.001542983,0.0009202181,0.0009695542,0.003248356],"category_scores_gemma":[0.008755459,0.0006315295,0.000483003,0.0005872829,0.001083837,0.001955587,0.001185668,0.0009939328,0.0003390138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127302,"about_ca_system_score_gemma":0.001488214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005971541,"about_ca_topic_score_gemma":0.008274016,"domain_scores_codex":[0.9995877,0.0001510981,0.00001742634,0.00004792315,0.0001041603,0.00009169468],"domain_scores_gemma":[0.995935,0.003166099,0.0003034316,0.0001539888,0.0002694261,0.0001720211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002170679,0.00005050922,0.0009939426,0.00004781816,0.00002248827,0.0001235788,0.00007006087,0.9509524,0.000717735,0.03595621,0.0004597502,0.01038849],"study_design_scores_gemma":[0.00001191565,0.00001089455,0.00004439266,0.000001940381,0.000001261022,0.000004081872,0.000009502157,0.9883212,0.0001353934,0.01139237,0.00006508252,0.000002003213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3463858,0.0002211838,0.64025,0.0004191798,0.00004634614,0.0001369603,0.0001976939,0.000650484,0.01169241],"genre_scores_gemma":[0.8815808,0.00009011433,0.1157949,0.00004791873,0.00001455323,0.00009529486,0.0001992992,0.00008124003,0.002095949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005971541,"threshold_uncertainty_score":0.0118736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005021927800946435,"score_gpt":0.2062569761481126,"score_spread":0.2012350483471662,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}