{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003356853,0.002013192,0.002652461,0.001820824,0.002389425,0.006947857,0.003796828,0.003849442,0.01594498],"category_scores_gemma":[0.03884446,0.001256759,0.001880846,0.002614821,0.003754502,0.012478,0.004093521,0.005604796,0.001012017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005242621,"about_ca_system_score_gemma":0.003097825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01008025,"about_ca_topic_score_gemma":0.01064826,"domain_scores_codex":[0.9950227,0.002005196,0.000240898,0.0008473991,0.000815846,0.001067986],"domain_scores_gemma":[0.9031879,0.08843184,0.00301452,0.0018891,0.001125229,0.002351356],"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.001853934,0.000896344,0.008934513,0.0009297022,0.0003707217,0.0006488133,0.001232416,0.7316017,0.002869502,0.1989219,0.01599332,0.03574716],"study_design_scores_gemma":[0.0002460409,0.00009968301,0.001470702,0.00004875153,0.00008164096,0.0001690545,0.0004240354,0.7294267,0.0005838543,0.2659317,0.001475054,0.00004289599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7320504,0.001609094,0.1890594,0.01422426,0.0002256846,0.0008026734,0.005266107,0.0008745638,0.05588786],"genre_scores_gemma":[0.9359254,0.001109264,0.04901518,0.0007400759,0.0002526318,0.0004693589,0.002743463,0.0003968261,0.009347826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01594498,"threshold_uncertainty_score":0.05334127,"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."}}