{"id":"W4389331594","doi":"10.2139/ssrn.4655155","title":"Approximate Nash Equilibria Algorithms for Weighted Congestion Games and Their Runtimes","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Nash equilibrium; Computer science; Algorithm; Best response; Parallel computing; Mathematical optimization; Mathematics","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.006178337,0.002719398,0.002110848,0.00265083,0.001785437,0.006033659,0.004379876,0.002917066,0.01655603],"category_scores_gemma":[0.03938396,0.001376541,0.001956715,0.003081351,0.002173011,0.009976296,0.003419254,0.005223977,0.003073151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005181069,"about_ca_system_score_gemma":0.005035526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007083867,"about_ca_topic_score_gemma":0.01496617,"domain_scores_codex":[0.9941451,0.001812056,0.0003375349,0.001371899,0.001364196,0.0009692438],"domain_scores_gemma":[0.9753004,0.01826547,0.000995221,0.002937058,0.001602647,0.0008991972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002143567,0.0009188011,0.004712505,0.0006796143,0.0004070015,0.0001561706,0.000673177,0.5383974,0.003699408,0.171657,0.02574668,0.2508088],"study_design_scores_gemma":[0.0001503168,0.00005303521,0.0003433807,0.00003805479,0.00008258469,0.00005910409,0.00009291508,0.8652475,0.001381014,0.1309215,0.001607545,0.00002296665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0937027,0.002386449,0.8683072,0.002322165,0.0003851074,0.000334177,0.001197293,0.007333604,0.02403126],"genre_scores_gemma":[0.4939933,0.0008735317,0.4892865,0.0005931713,0.0003092255,0.000703709,0.001835651,0.002301435,0.01010343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01655603,"threshold_uncertainty_score":0.05538541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08867629441425895,"score_gpt":0.3687151763499721,"score_spread":0.2800388819357132,"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."}}