Papers
Topics
Authors
Recent
2000 character limit reached

Augmented Probability Simulation Methods for Sequential Games (1910.04574v3)

Published 10 Oct 2019 in stat.CO and cs.GT

Abstract: We present a robust framework with computational algorithms to support decision makers in sequential games. Our framework includes methods to solve games with complete information, assess the robustness of such solutions and, finally, approximate adversarial risk analysis solutions when lacking complete information. Existing simulation based approaches can be inefficient when dealing with large sets of feasible decisions; the game of interest may not even be solvable to the desired precision for continuous decisions. Hence, we provide a novel alternative solution method based on the use of augmented probability simulation. While the proposed framework conceptually applies to multi-stage sequential games, the discussion focuses on two-stage sequential defend-attack problems.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. Simulation optimization: a review of algorithms and applications. Annals of Operations Research 240, 351–380.
  2. Representing Bayesian games without a common prior, in: van der Hoek, Kaninka, L., Sen (Eds.), Proc. AAMAS 2010. IFAMAS.
  3. Adversarial risk analysis: An overview. Wiley Interdisciplinary Reviews: Computational Statistics 14, e1530.
  4. Adversarial Risk Analysis. CRC Press.
  5. Some properties of the bilevel programming problem. Journal of optimization theory and applications 68, 371–378.
  6. Decision analysis by augmented probability simulation. Management Science 45, 995–1007.
  7. Pattern recognition and machine learning. Springer.
  8. Assessing convergence of Markov chain Monte Carlo algorithms. Statistics and Computing 8, 319–335.
  9. Defending critical infrastructure. Interfaces 36, 530–544.
  10. The modal age of statistics. International Statistical Review 88, 122–141.
  11. A comprehensive approach to mode clustering. Electronic Journal of Statistics 10, 210–241.
  12. Understanding the Metropolis-Hastings algorithm. The American Statistician 49, 327–335.
  13. A Course in Probability Theory. Ac Press.
  14. Augmented Markov chain Monte Carlo simulation for two-stage stochastic programs with recourse. Decision Analysis 11, 250–264.
  15. Augmented nested sampling for stochastic programs with recourse and endogenous uncertainty. Naval Research Logistics (NRL) 64, 613–627.
  16. Augmented simulation methods for discrete stochastic optimization with recourse. Annals of Operations Research , 1–23.
  17. Algorithmic Decision Theory. volume 13023. Springer.
  18. Statistical decision theory. Wiley.
  19. Handbook of simulation optimization. volume 216. Springer.
  20. Markov chain Monte Carlo: Stochastic simulation for Bayesian inference. Chapman and Hall/CRC.
  21. Adversarial risk analysis for bi-agent influence diagrams: An algorithmic approach. European Journal of Operational Research 273, 1085–1096.
  22. Karush-Kuhn-Tucker conditions. Optimization 10, 725.
  23. Games with incomplete information played by Bayesian players. Management Science 14, 159–182.
  24. Game Theory. Routledge.
  25. Sensitivity Analysis in Multiobjective Decision Making. Springer Verlag.
  26. Robust Bayesian Analysis. volume 152. Springer Science & Business Media.
  27. Properties on non-linear least squares estimators. Annals of Mathematical Statistics 40, 633–643.
  28. The polynomial hierarchy and a simple model for competitive analysis. Mathematical programming 32, 146–164.
  29. Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization, in: AAMAS, pp. 837–846.
  30. Modeling values for anti-terrorism analysis. Risk Analysis 27, 585–596.
  31. Stackelberg vs. Nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. Proc. 24th AAAI Conf. , 805–810.
  32. Stackelberg vs. Nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. Jour. Art. Intell. Res. 41, 297–327.
  33. On generalized Stackelberg strategies. Jour. Optim. Theory Appl. 26, 637–643.
  34. Simulation based optimal design. Handbook of Statistics 25, 509–518.
  35. Optimal Bayesian design by inhomogeneous Markov chain simulation. Journal of the American Statistical Association 99, 788–798.
  36. Gradient methods for solving Stackelberg games, in: International Conference on Algorithmic DecisionTheory, Springer. pp. 126–140.
  37. Simple procedures for selecting the best simulated system when the number of alternatives is large. Operations Research 49, 950–963.
  38. Algorithmic Game Theory. volume 1. Cambridge University Press Cambridge.
  39. Computing approximate Nash equilibria and robust best responses using sampling. Journal of AI Research 42, 575–605.
  40. A unified framework for stochastic optimization. European Journal of Operational Research 275, 795–821.
  41. Adversarial risk analysis for counterterrorism modeling. Risk Analysis 32, 894–915.
  42. An adversarial risk analysis framework for cybersecurity. Risk Analysis 41, 16–36. doi:DOI:10.1111/risa.13331.
  43. Adversarial Machine Learning: Perspectives from adversarial risk analysis. arXiv e-prints , arXiv:1908.06901arXiv:1908.06901.
  44. On weak convergence and optimality of kernel density estimates of the mode. The Annals of Statistics , 629–647.
  45. Monte Carlo approximations in Bayesian decision theory. Journal of the American Statistical Association 84, 727–732.
  46. Stackelberg security games: looking beyond a decade of success. Proc. IJCAI-18 , 5494–5501.
  47. A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Transactions on Evolutionary Computation 22, 276–295.
  48. Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods. Journal of the Royal Statistical Society: Series B (Methodological) 55, 3–23.
  49. The Theory of the Market Economy. Oxford U.P.
  50. Augmented Probability Simulation. https://github.com/albertotb/aps.
  51. A human-like game theory-based controller for automatic lane changing. Transportation Research Part C: Emerging Technologies 88, 140–158.
  52. Balancing terrorism and natural disasters—defensive strategy with endogenous attacker effort. Operations Research 55, 976–991.
Citations (9)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.