{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003124889,0.0002669059,0.000395143,0.000396131,0.00005238689,0.0000657681,0.0001903043,0.000292222,0.00006190685],"category_scores_gemma":[0.000007821109,0.0002970519,0.00007356758,0.001172618,0.00002695565,0.0002869519,7.803552e-7,0.0005287057,0.00002686406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001270274,"about_ca_system_score_gemma":0.00005962566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001430443,"about_ca_topic_score_gemma":0.0001514939,"domain_scores_codex":[0.9981828,0.0001299153,0.0006760794,0.0002931724,0.0003472133,0.000370835],"domain_scores_gemma":[0.9992556,0.00008472566,0.0001176969,0.0002946014,0.000152366,0.0000950129],"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.00008233742,0.0002356555,0.00006598701,0.0002588763,0.0001269004,0.000005573308,0.0004514559,0.7650148,0.2297301,0.00005042004,0.00217658,0.001801342],"study_design_scores_gemma":[0.001271341,0.0002252432,0.000325413,0.0001572091,0.0000338235,0.00004970072,0.0001705091,0.9665996,0.03019148,0.00001025798,0.0004485939,0.0005168224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2108197,0.0001729177,0.7832979,0.00001270954,0.002310183,0.0006015489,0.00005838382,0.0002848875,0.002441784],"genre_scores_gemma":[0.9993756,0.00002139196,0.0001952707,0.000005393848,0.00001268602,0.00006548685,0.00001402238,0.00007257184,0.0002375124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7885559,"threshold_uncertainty_score":0.9999481,"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."}}