{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01185945,0.0003856048,0.0006207629,0.0004128871,0.0004715331,0.0007533584,0.001253608,0.0003160195,0.00004537453],"category_scores_gemma":[0.0008082784,0.0002684199,0.0003298709,0.0003777765,0.0002132182,0.0002238008,0.0005807891,0.002320683,0.00009249921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002579489,"about_ca_system_score_gemma":0.001572925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001334562,"about_ca_topic_score_gemma":0.00007778827,"domain_scores_codex":[0.9956585,0.0003218584,0.0008884084,0.000824807,0.0005130933,0.001793309],"domain_scores_gemma":[0.9963849,0.001543973,0.0007936222,0.0006689549,0.0004512259,0.0001573239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002129967,0.0001189549,0.0003160451,0.00003944092,0.0005885149,0.000001922487,0.001005843,0.0002658644,0.001491647,0.6268567,0.00292704,0.3661751],"study_design_scores_gemma":[0.0004422926,0.0001243419,0.0002329207,0.00005392131,0.00005685291,0.00009805915,0.002198634,0.01647318,0.0002668066,0.9770874,0.002673732,0.0002919006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3944084,0.006593151,0.585502,0.009202752,0.001438111,0.001664687,0.0002976176,0.0003150139,0.0005783123],"genre_scores_gemma":[0.9741207,0.005438081,0.002368186,0.0001089426,0.001130199,0.0002995192,0.0000874277,0.0001056013,0.01634131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5831338,"threshold_uncertainty_score":0.999981,"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."}}