View Document Preview and Link Document Date: 2014-05-02 13:24:05 Open Document File Size: 1,21 MB Share Result on Facebook
City Constraint / / Company AUAI Press / Cambridge University Press / Halsted Press / ct Rt Pt / Multiagent Systems / Intel / / Country Canada / / / Facility University of Southern California / University of Toronto / Nanyang Technological University / / IndustryTerm δ-optimal solution / expected utilities / maximin-based robust solutions / minimax regret solution / game-theoretic solutions / feasible solution / binary search / local search / binary-search termination threshold / final solution / bCISM algorithm / online appendix / e - commerce / binary search decision problem / binary-search based algorithm / / Organization Cambridge University / University of Southern California / Los Angeles / Artificial Copyright Intelligence / Nanyang Technological University / Singapore / Association for the Advancement / University of Toronto / / Person Payoff Uncertainty / Max Regret / Van Roy / Pt / / / Position driver / Rt / reward Rt / / ProvinceOrState Southern California / California / / PublishedMedium Journal of Economic Theory / / Region Southern California / / Technology three MR algorithms / binary-search based algorithm / Approximate Linearization Algorithm / bCISM algorithm / artificial intelligence / ALARM algorithm / MMR algorithms Evaluating MMR Algorithms / / URL http / SocialTag 
Regret-based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty Thanh H. Nguyen1 , Amulya Yadav1 , Bo An2 , Milind Tambe1 , Craig Boutilier3 1 University of Southern California, Los