{"id":"W2394792037","doi":"10.1609/aiide.v6i1.12410","title":"On the Complexity of Two-Player Attrition Games Played on Graphs","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Attrition; Heuristics; Computer science; Mathematical proof; Graph; Core (optical fiber); Variety (cybernetics); Time complexity; Game theory; Theoretical computer science; Mathematical economics; Mathematics; Artificial intelligence; Algorithm","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.0003803572,0.000354708,0.0003496685,0.0001939563,0.0002285858,0.0004977267,0.00161204,0.00008363457,0.0001164949],"category_scores_gemma":[0.0006832928,0.0002187739,0.000223849,0.0003553863,0.001267613,0.0008149117,0.0004094733,0.0006495347,0.00006970995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000501776,"about_ca_system_score_gemma":0.00004040636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005108502,"about_ca_topic_score_gemma":0.00002448551,"domain_scores_codex":[0.9975711,0.00003170814,0.00072376,0.0006076299,0.0007040757,0.0003617094],"domain_scores_gemma":[0.9977043,0.0005926035,0.0005927148,0.0004469423,0.0005587316,0.0001047635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003013795,0.0005783674,0.0002524905,0.00001429537,0.0000438258,5.678809e-7,0.001735152,0.00002289689,0.0377821,0.9246392,0.0001408583,0.0344889],"study_design_scores_gemma":[0.0000344552,0.0007611829,0.0002246601,0.0002672823,0.000007797644,0.000004179542,0.001336742,0.01079154,0.5953103,0.3910237,0.00006126612,0.0001768836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.971799,0.000004494896,0.004141116,0.005739725,0.0006442177,0.0006940032,0.00003740841,0.00004541387,0.01689465],"genre_scores_gemma":[0.9989911,0.00001410681,0.0001807047,0.0005999019,0.00004175548,0.00005023176,0.00000171627,0.00001444216,0.0001060405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5575283,"threshold_uncertainty_score":0.892134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0837733008916107,"score_gpt":0.3072169081646831,"score_spread":0.2234436072730724,"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."}}