Jerzy A. Filar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jerzy A. Filar has a total of 136 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir Ejov
Flinders University
31 shared publications - Michael Haythorpe
Flinders University, Adelaide, Australia
15 shared publications - Giang T. Nguyen
The University of Adelaide
13 shared publications - Vivek Shripad Borkar
Department of Electrical Engineering, Indian Institute of Technology Bombay, Powai, Mumbai, 400076, India
13 shared publications - Konstantin Avrachenkov
Inria, Université Côte d’Azur
10 shared publications - Serguei Rossomakhine
Flinders University
6 shared publications
Latest Publications
- Open Access
- 4 December 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 355 (3) , 2775-2776
Decision-making under uncertainty: a multidisciplinary perspective
- 4 December 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 355 (3) , 2775-2776
Open AccessDecision-making under uncertainty: a multidisciplinary perspective
- Open Access
- 18 July 2025
- Published by Elsevier in Mathematical Biosciences
- Vol. 387, 109497
Persistence index for harvested populations
- 18 July 2025
- Published by Elsevier in Mathematical Biosciences
- Vol. 387, 109497
Open AccessPersistence index for harvested populations
- Open Access
- 9 July 2025
- Published by Springer Nature in Research Square
Optimal policy analysis for monotonic (PO)MDPs and an application to fishery management
We study the monotonicity properties of optimal policies for a class of fully/partially observable Markov Decision Processes (MDPs) motivated by renewable natural resource management. We first introduce a new class of deterministic monotonic MDPs with continuous state and action spaces, and we prove that their optimal policies are monotonic in the state. These monotonic MDPs are particularly interesting, because they do not satisfy certain supermodularity assumptions on the reward function and the transition dynamics in previous monotonicity analyses for the optimal policies of MDPs, and our proof requires an original inductive analysis. Our theoretical results are numerically illustrated on a fully observable fishery management problem, using a modified value iteration algorithm that computes near-optimal monotonic policies with a max-min smoothing strategy. We then introduce a generalization of our monotonic MDPs to handle partial observability and stochas-ticity, and we conjecture the existence of a near-optimal policy that is monotonic in the expected state. Our conjecture is supported by numerical results on a partially observable fishery management problem, using algorithms for optimizing over a class of monotonic policies called multi-threshold policies. Moreover, when the environment is unknown and needs to be learned through interactions, multi-threshold policies appear to be more robust to model learning error than general policies in a model-based offline reinforcement learning approach.
- 9 July 2025
- Published by Springer Nature in Research Square
Open AccessOptimal policy analysis for monotonic (PO)MDPs and an application to fishery management
We study the monotonicity properties of optimal policies for a class of fully/partially observable Markov Decision Processes (MDPs) motivated by renewable natural resource management. We first introduce a new class of deterministic monotonic MDPs with continuous state and action spaces, and we prove that their optimal policies are monotonic in the state. These monotonic MDPs are particularly interesting, because they do not satisfy certain supermodularity assumptions on the reward function and the transition dynamics in previous monotonicity analyses for the optimal policies of MDPs, and our proof requires an original inductive analysis. Our theoretical results are numerically illustrated on a fully observable fishery management problem, using a modified value iteration algorithm that computes near-optimal monotonic policies with a max-min smoothing strategy. We then introduce a generalization of our monotonic MDPs to handle partial observability and stochas-ticity, and we conjecture the existence of a near-optimal policy that is monotonic in the expected state. Our conjecture is supported by numerical results on a partially observable fishery management problem, using algorithms for optimizing over a class of monotonic policies called multi-threshold policies. Moreover, when the environment is unknown and needs to be learned through interactions, multi-threshold policies appear to be more robust to model learning error than general policies in a model-based offline reinforcement learning approach.
- Open Access
- 22 November 2023
- Published by Elsevier in Mathematical Biosciences
- Vol. 367, 109111
Overcoming the impossibility of age-balanced harvest
- 22 November 2023
- Published by Elsevier in Mathematical Biosciences
- Vol. 367, 109111
Open AccessOvercoming the impossibility of age-balanced harvest
- Open Access
- 1 August 2023
- Published by Springer Nature in Computational Statistics
- Vol. 39 (4) , 2183-2216
Multi-pass Bayesian estimation: a robust Bayesian method
The prior plays a central role in Bayesian inference but specifying a prior is often difficult and a prior considered appropriate by a modeler may be significantly biased. We propose multi-pass Bayesian estimation (MBE), a robust Bayesian method capable of adjusting the prior’s influence on the inference result based on the prior’s quality. MBE adjusts the relative importance of the prior and the data by iteratively performing approximate Bayesian updates on the given data, with the number of updates determined using a cross-validation method. The repeated use of the data resembles the data cloning method, but data cloning performs maximum likelihood estimation (MLE), while MBE interpolates between standard Bayesian inference and MLE; there are also algorithmic differences in how MBE and data cloning make repeated use of the data. Alternatively, MBE can be considered a method for constructing a new prior from the given initial prior and the data. We additionally provide a new non-asymptotic bound on the convergence of data cloning, and provide an MBE-like iterative heuristic approach which achieves faster convergence speed by boosting posterior variance. In numerical simulations on several simulated and real-world datasets, MBE provides robust inference results as compared to standard Bayesian inference and MLE.
- 1 August 2023
- Published by Springer Nature in Computational Statistics
- Vol. 39 (4) , 2183-2216
Open AccessMulti-pass Bayesian estimation: a robust Bayesian method
The prior plays a central role in Bayesian inference but specifying a prior is often difficult and a prior considered appropriate by a modeler may be significantly biased. We propose multi-pass Bayesian estimation (MBE), a robust Bayesian method capable of adjusting the prior’s influence on the inference result based on the prior’s quality. MBE adjusts the relative importance of the prior and the data by iteratively performing approximate Bayesian updates on the given data, with the number of updates determined using a cross-validation method. The repeated use of the data resembles the data cloning method, but data cloning performs maximum likelihood estimation (MLE), while MBE interpolates between standard Bayesian inference and MLE; there are also algorithmic differences in how MBE and data cloning make repeated use of the data. Alternatively, MBE can be considered a method for constructing a new prior from the given initial prior and the data. We additionally provide a new non-asymptotic bound on the convergence of data cloning, and provide an MBE-like iterative heuristic approach which achieves faster convergence speed by boosting posterior variance. In numerical simulations on several simulated and real-world datasets, MBE provides robust inference results as compared to standard Bayesian inference and MLE.
- 19 August 2022
- Published by Taylor & Francis in Stochastic Models
- Vol. 39 (2) , 383-413
Hidden equations of risk critical thresholds
We consider the problem of parametric sensitivity of a particular characterization of risk, with respect to a threshold parameter Such threshold risk is modeled as the probability of a perturbed function of a random variable falling below 0. We demonstrate that for polynomial and rational functions of that random variable there exist at most finitely many risk critical points. The latter are those special values of the threshold parameter for which rate of change of risk is unbounded as δ approaches them. Under weak conditions, we characterize candidates for risk critical points as zeroes of either the discriminant of a relevant perturbed polynomial, or of its leading coefficient, or both. Thus the equations that need to be solved are themselves polynomial equations in δ that exploit the algebraic properties of the underlying polynomial or rational functions. We name these important equations as” hidden equations of risk critical thresholds”.- 19 August 2022
- Published by Taylor & Francis in Stochastic Models
- Vol. 39 (2) , 383-413
Hidden equations of risk critical thresholds
We consider the problem of parametric sensitivity of a particular characterization of risk, with respect to a threshold parameter Such threshold risk is modeled as the probability of a perturbed function of a random variable falling below 0. We demonstrate that for polynomial and rational functions of that random variable there exist at most finitely many risk critical points. The latter are those special values of the threshold parameter for which rate of change of risk is unbounded as δ approaches them. Under weak conditions, we characterize candidates for risk critical points as zeroes of either the discriminant of a relevant perturbed polynomial, or of its leading coefficient, or both. Thus the equations that need to be solved are themselves polynomial equations in δ that exploit the algebraic properties of the underlying polynomial or rational functions. We name these important equations as” hidden equations of risk critical thresholds”.- Open Access
- 10 February 2022
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 13 (1) , 1-34
Where Do Mistakes Lead? A Survey of Games with Incompetent Players
Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings.
- 10 February 2022
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 13 (1) , 1-34
Open AccessWhere Do Mistakes Lead? A Survey of Games with Incompetent Players
Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings.
- Open Access
- 12 April 2021
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 17 (4) , e1008523
Mistakes can stabilise the dynamics of rock-paper-scissors games
A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium.
- 12 April 2021
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 17 (4) , e1008523
Open AccessMistakes can stabilise the dynamics of rock-paper-scissors games
A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium.
- Open Access
- 4 November 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (11) , 1945
Prioritised Learning in Snowdrift-Type Games
Cooperation is a ubiquitous and beneficial behavioural trait despite being prone to exploitation by free-riders. Hence, cooperative populations are prone to invasions by selfish individuals. However, a population consisting of only free-riders typically does not survive. Thus, cooperators and free-riders often coexist in some proportion. An evolutionary version of a Snowdrift Game proved its efficiency in analysing this phenomenon. However, what if the system has already reached its stable state but was perturbed due to a change in environmental conditions? Then, individuals may have to re-learn their effective strategies. To address this, we consider behavioural mistakes in strategic choice execution, which we refer to as incompetence. Parametrising the propensity to make such mistakes allows for a mathematical description of learning. We compare strategies based on their relative strategic advantage relying on both fitness and learning factors. When strategies are learned at distinct rates, allowing learning according to a prescribed order is optimal. Interestingly, the strategy with the lowest strategic advantage should be learnt first if we are to optimise fitness over the learning path. Then, the differences between strategies are balanced out in order to minimise the effect of behavioural uncertainty.
- 4 November 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (11) , 1945
Open AccessPrioritised Learning in Snowdrift-Type Games
Cooperation is a ubiquitous and beneficial behavioural trait despite being prone to exploitation by free-riders. Hence, cooperative populations are prone to invasions by selfish individuals. However, a population consisting of only free-riders typically does not survive. Thus, cooperators and free-riders often coexist in some proportion. An evolutionary version of a Snowdrift Game proved its efficiency in analysing this phenomenon. However, what if the system has already reached its stable state but was perturbed due to a change in environmental conditions? Then, individuals may have to re-learn their effective strategies. To address this, we consider behavioural mistakes in strategic choice execution, which we refer to as incompetence. Parametrising the propensity to make such mistakes allows for a mathematical description of learning. We compare strategies based on their relative strategic advantage relying on both fitness and learning factors. When strategies are learned at distinct rates, allowing learning according to a prescribed order is optimal. Interestingly, the strategy with the lowest strategic advantage should be learnt first if we are to optimise fitness over the learning path. Then, the differences between strategies are balanced out in order to minimise the effect of behavioural uncertainty.
- Open Access
Square Root Laws in Structured Fisheries
We introduce the term net-proliferation in the context of fisheries and establish relations between the proliferation and net-proliferation that are economically and sustainably favored. The resulting square root laws are analytically derived for species following the Beverton-Holt recurrence but, we show, can also serve as reference points for other models. The practical relevance of these analytically derived square root laws is tested on the the Barramundi fishery in the Southern Gulf of Carpentaria, Australia. A Beverton-Holt model, including stochasticity to account for model uncertainty, is fitted to a time series of catch and abundance index for this fishery. Simulations show, that despite the stochasticity, the population levels remain sustainable under the square root law. The application, with its inherited model uncertainty, sparks a risk sensitivity analysis regarding the probability of populations falling below an unsustainable threshold. Characterization of such sensitivity helps in the understanding of both dangers of overfishing and potential remedies.
Open AccessSquare Root Laws in Structured Fisheries
We introduce the term net-proliferation in the context of fisheries and establish relations between the proliferation and net-proliferation that are economically and sustainably favored. The resulting square root laws are analytically derived for species following the Beverton-Holt recurrence but, we show, can also serve as reference points for other models. The practical relevance of these analytically derived square root laws is tested on the the Barramundi fishery in the Southern Gulf of Carpentaria, Australia. A Beverton-Holt model, including stochasticity to account for model uncertainty, is fitted to a time series of catch and abundance index for this fishery. Simulations show, that despite the stochasticity, the population levels remain sustainable under the square root law. The application, with its inherited model uncertainty, sparks a risk sensitivity analysis regarding the probability of populations falling below an unsustainable threshold. Characterization of such sensitivity helps in the understanding of both dangers of overfishing and potential remedies.