A short introduction to goal problems in abstract gambling theory is given, along with statementes of some of the main theorems and a number of examples, open problems and references. Emphasis is on the finite-state, countably-additive setting with such classical objectives as reaching a goal, hitting a goal infinitely often, staying in the goal, and maximizing the average time spent at a goal.keywords: gambling theory, stochastic processes, Markov strategies.Se da una breve introducción a problemas de metas en teoría abstracta del jugador, así como el enunciado de algunos de los principales teoremas y un número de ejemplos, problemas abiertos y referencias. Se hace énfasis en el caso de estado finito, contable aditivo, con objetivos clá...
International audienceIn several standard models of dynamic programming (gambling houses, MDPs, POMD...
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
In every finite-state leavable gambling problem and in every finite-state Markov decision process wi...
A short introduction to goal problems in abstract gambling theory is given, along with statementes o...
In every finite-state leavable gambling problem and in every finite-state Markov decision process wi...
A Complex System can be defined as a natural, artificial, social, or economic entity whose model inv...
AbstractIn a decision process (gambling or dynamic programming problem) with finite state space and ...
In several standard models of dynamic programming (gambling houses, MDPs, POMDPs), we prove the exis...
What is the current place of mathematics in problem gambling research, and how can mathematics contr...
In this paper I will first describe the theoretical background of a certain kind of random process, ...
(in English): Character of the work is purely theoretical and it pursues game theory in the perspect...
In Formal Methods we use mathematical structures to model real systems we want to build, or to reaso...
This thesis examines the card game poker from the perspective of game theory. After an initial look...
AbstractIn Formal Methods we use mathematical structures to model real systems we want to build, or ...
International audienceIn several standard models of dynamic programming (gambling houses, MDPs, POMD...
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
In every finite-state leavable gambling problem and in every finite-state Markov decision process wi...
A short introduction to goal problems in abstract gambling theory is given, along with statementes o...
In every finite-state leavable gambling problem and in every finite-state Markov decision process wi...
A Complex System can be defined as a natural, artificial, social, or economic entity whose model inv...
AbstractIn a decision process (gambling or dynamic programming problem) with finite state space and ...
In several standard models of dynamic programming (gambling houses, MDPs, POMDPs), we prove the exis...
What is the current place of mathematics in problem gambling research, and how can mathematics contr...
In this paper I will first describe the theoretical background of a certain kind of random process, ...
(in English): Character of the work is purely theoretical and it pursues game theory in the perspect...
In Formal Methods we use mathematical structures to model real systems we want to build, or to reaso...
This thesis examines the card game poker from the perspective of game theory. After an initial look...
AbstractIn Formal Methods we use mathematical structures to model real systems we want to build, or ...
International audienceIn several standard models of dynamic programming (gambling houses, MDPs, POMD...
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
In every finite-state leavable gambling problem and in every finite-state Markov decision process wi...