z-logo
open-access-imgOpen Access
Regret-Based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty
Author(s) -
Thanh H. Nguyen,
Amulya Yadav,
Bo An,
Milind Tambe,
Craig Boutilier
Publication year - 2014
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v28i1.8804
Subject(s) - 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 , combinatorics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom