{"id":"W2193871400","doi":"10.1609/aaai.v28i1.8804","title":"Regret-Based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Multidisciplinary University Research Initiative; Ministry of Education, India","keywords":"Regret; Stackelberg competition; Preference; Stochastic game; Minimax; Interval (graph theory); Mathematical economics; Mathematical optimization; Key (lock); Preference elicitation; Mathematics; Computer science; Expected utility hypothesis; Machine learning; Statistics; Computer security","routes":{"ca_aff":true,"ca_fund":true,"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.000319457,0.0001790539,0.0002174294,0.00008864258,0.0001452647,0.00009523339,0.0002691997,0.00008192584,0.00002798257],"category_scores_gemma":[0.0003434122,0.0001240664,0.00005285294,0.0003125451,0.0002382938,0.0001823032,0.00001998553,0.0001552884,0.000001474317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003559788,"about_ca_system_score_gemma":0.0000284553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002422774,"about_ca_topic_score_gemma":0.00004219245,"domain_scores_codex":[0.9989836,0.00001303904,0.0003000234,0.0002659115,0.0002323664,0.0002050815],"domain_scores_gemma":[0.9990026,0.0001462082,0.0001349349,0.0001402313,0.0005235853,0.00005241801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001619774,0.00003501394,0.000708344,0.0002770844,0.00002590853,1.922892e-8,0.0007048351,0.8575276,0.004946858,0.108769,0.0000334148,0.02680989],"study_design_scores_gemma":[0.00003922085,0.000175056,0.000137544,0.0001290856,0.00003308502,3.792654e-7,0.0003717873,0.8509939,0.1171804,0.03076478,0.00003112265,0.0001436317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.578766,0.00001507949,0.4176581,0.000595095,0.0000888748,0.0006126827,0.00001665724,0.000106538,0.002140922],"genre_scores_gemma":[0.9957806,0.00002006723,0.004039233,0.00004963488,0.00003408843,0.00004774981,0.000003743416,0.00001327482,0.00001163253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4170145,"threshold_uncertainty_score":0.505928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02755727408329766,"score_gpt":0.2440272760095067,"score_spread":0.216470001926209,"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."}}