{"id":"W156513541","doi":"","title":"Computing pure Nash equilibria in symmetric action graph games","year":2007,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nash equilibrium; Treewidth; Best response; Combinatorial game theory; Mathematics; Graph; Epsilon-equilibrium; Time complexity; Game theory; Combinatorics; Repeated game; Mathematical optimization; Computer science; Mathematical economics; Line graph; Pathwidth","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":[],"consensus_categories":[],"category_scores_codex":[0.004578459,0.00007853358,0.0001380408,0.0007479989,0.00009022469,0.0001137913,0.0004110124,0.0000619044,0.0004006892],"category_scores_gemma":[0.0007822341,0.00005827524,0.00006414038,0.003787192,0.00005661078,0.0002117185,0.00008542408,0.0001299653,0.0005310715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002118748,"about_ca_system_score_gemma":0.00001562284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002170331,"about_ca_topic_score_gemma":0.0001263234,"domain_scores_codex":[0.9984429,0.00008381114,0.0004523514,0.0003040382,0.0004795735,0.0002372947],"domain_scores_gemma":[0.9976535,0.001729849,0.0001143036,0.0003430451,0.00008426474,0.00007504714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003230068,0.000135735,0.0443979,0.0000028117,0.000005982532,0.000005066553,0.0004231569,0.000215941,0.0116161,0.4227224,0.003622654,0.5168199],"study_design_scores_gemma":[0.000450977,0.00004277709,0.393177,0.0000121585,0.000005233317,0.00001733768,0.0040504,0.004960608,0.007069218,0.5731689,0.01679921,0.000246195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8831831,0.00003657722,0.05330506,0.0003423842,0.0001430228,0.0001091867,7.781985e-7,0.00006110885,0.06281883],"genre_scores_gemma":[0.9962429,0.000002587515,0.001335766,0.0001860224,0.00006646534,0.000001656574,0.000001143856,0.000004592048,0.002158855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5165737,"threshold_uncertainty_score":0.6826027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1401855833694327,"score_gpt":0.4312577441423012,"score_spread":0.2910721607728685,"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."}}