Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource
From MaRDI portal
Publication:2672153
DOI10.1016/j.ejor.2022.01.039OpenAlexW3007386409MaRDI QIDQ2672153
Publication date: 8 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.10172
Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Probabilistic games; gambling (91A60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Determining all Nash equilibria in a (bi-linear) inspection game
- Dynamic programming and board games: a survey
- Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks
- Contest success functions: an extension
- The strategic equivalence of rent-seeking, innovation, and patent-race games.
- Games with espionage
- A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game
- Allocating multiple defensive resources in a zero-sum game setting
- Dynamic programming analysis of the TV game ``Who wants to be a millionaire?
- Optimal R&D programs in a random environment
- A Stochastic Competitive R&D Race Where “Winner Takes All”
- The best banking strategy when playing The Weakest Link
- Dynamic programming in cricket: choosing a night watchman
- ON THE APPLICATION OF DYNAMIC PROGRAMING TO THE DETERMINATION OF OPTIMAL PLAY IN CHESS AND CHECKERS
- An Algorithm for the Traveling Salesman Problem
- Deep Blue
This page was built for publication: Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource
