scholarly journals Combined Games with Randomly Delayed Beginnings

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 534
Author(s):  
F. Thomas Bruss
Keyword(s):  
Discrete Time ◽  
Real World ◽  
Optimal Stopping ◽  
Random Variables ◽  
Approximate Solutions ◽  
Real World Problems

This paper presents two-person games involving optimal stopping. As far as we are aware, the type of problems we study are new. We confine our interest to such games in discrete time. Two players are to chose, with randomised choice-priority, between two games G1 and G2. Each game consists of two parts with well-defined targets. Each part consists of a sequence of random variables which determines when the decisive part of the game will begin. In each game, the horizon is bounded, and if the two parts are not finished within the horizon, the game is lost by definition. Otherwise the decisive part begins, on which each player is entitled to apply their or her strategy to reach the second target. If only one player achieves the two targets, this player is the winner. If both win or both lose, the outcome is seen as “deuce”. We motivate the interest of such problems in the context of real-world problems. A few representative problems are solved in detail. The main objective of this article is to serve as a preliminary manual to guide through possible approaches and to discuss under which circumstances we can obtain solutions, or approximate solutions.

scholarly journals Ordinal patterns-based methodologies for distinguishing chaos from noise in discrete time series

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Massimiliano Zanin ◽  
Felipe Olivares
Keyword(s):  
Time Series ◽  
Discrete Time ◽  
Real World ◽  
Chaotic Maps ◽  
Computational Cost ◽  
Permutation Patterns ◽  
Discrete Time Series ◽  
Ordinal Patterns ◽  
Theoretical Foundations ◽  
Real World Problems

AbstractOne of the most important aspects of time series is their degree of stochasticity vs. chaoticity. Since the discovery of chaotic maps, many algorithms have been proposed to discriminate between these two alternatives and assess their prevalence in real-world time series. Approaches based on the combination of “permutation patterns” with different metrics provide a more complete picture of a time series’ nature, and are especially useful to tackle pathological chaotic maps. Here, we provide a review of such approaches, their theoretical foundations, and their application to discrete time series and real-world problems. We compare their performance using a set of representative noisy chaotic maps, evaluate their applicability through their respective computational cost, and discuss their limitations.

scholarly journals Diffusion approximations for randomly arriving expert opinions in a financial market with Gaussian drift

2021 ◽  
Vol 58 (1) ◽  
pp. 197-216 ◽  
Author(s):  
Jörn Sass ◽  
Dorothee Westphal ◽  
Ralf Wunderlich
Keyword(s):  
Stock Returns ◽  
Financial Market ◽  
Discrete Time ◽  
High Frequency ◽  
Utility Maximization ◽  
Limit Theorems ◽  
Approximate Solutions ◽  
Diffusion Approximations ◽  
Expert Opinions ◽  
Arrival Intensity

AbstractThis paper investigates a financial market where stock returns depend on an unobservable Gaussian mean reverting drift process. Information on the drift is obtained from returns and randomly arriving discrete-time expert opinions. Drift estimates are based on Kalman filter techniques. We study the asymptotic behavior of the filter for high-frequency experts with variances that grow linearly with the arrival intensity. The derived limit theorems state that the information provided by discrete-time expert opinions is asymptotically the same as that from observing a certain diffusion process. These diffusion approximations are extremely helpful for deriving simplified approximate solutions of utility maximization problems.

scholarly journals Handrails through the Swamp? A Pilot to Test the Integration and Implementation Science Framework in Complex Real-World Research

2021 ◽  
Vol 13 (10) ◽  
pp. 5491
Author(s):  
Melissa Robson-Williams ◽  
Bruce Small ◽  
Roger Robson-Williams ◽  
Nick Kirk
Keyword(s):  
Pilot Study ◽  
Case Studies ◽  
Implementation Science ◽  
Real World ◽  
Environmental Problems ◽  
Environmental Research ◽  
Integrative Framework ◽  
The World ◽  
Science Framework ◽  
Real World Problems

The socio-environmental challenges the world faces are ‘swamps’: situations that are messy, complex, and uncertain. The aim of this paper is to help disciplinary scientists navigate these swamps. To achieve this, the paper evaluates an integrative framework designed for researching complex real-world problems, the Integration and Implementation Science (i2S) framework. As a pilot study, we examine seven inter and transdisciplinary agri-environmental case studies against the concepts presented in the i2S framework, and we hypothesise that considering concepts in the i2S framework during the planning and delivery of agri-environmental research will increase the usefulness of the research for next users. We found that for the types of complex, real-world research done in the case studies, increasing attention to the i2S dimensions correlated with increased usefulness for the end users. We conclude that using the i2S framework could provide handrails for researchers, to help them navigate the swamps when engaging with the complexity of socio-environmental problems.

Review of Network Flow Algorithms David P. Williamson

2021 ◽  
Vol 52 (1) ◽  
pp. 12-15
Author(s):  
S.V. Nagaraj
Keyword(s):  
Graduate Students ◽  
Real World ◽  
Network Flow ◽  
Network Flows ◽  
Optimization Problems ◽  
Capacity Constraints ◽  
Incoming Flow ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Real World Problems

This book is on algorithms for network flows. Network flow problems are optimization problems where given a flow network, the aim is to construct a flow that respects the capacity constraints of the edges of the network, so that incoming flow equals the outgoing flow for all vertices of the network except designated vertices known as the source and the sink. Network flow algorithms solve many real-world problems. This book is intended to serve graduate students and as a reference. The book is also available in eBook (ISBN 9781316952894/US$ 32.00), and hardback (ISBN 9781107185890/US$99.99) formats. The book has a companion web site www.networkflowalgs.com where a pre-publication version of the book can be downloaded gratis.

Help communities solve real-world problems with AI

AI Matters ◽  
2019 ◽  
Vol 5 (3) ◽  
pp. 12-14
Author(s):  
Tara Chklovski
Keyword(s):  
Real World ◽  
Real World Problems

QALO-MOR: Improved antlion optimizer based on quantum information theory for model order reduction

2021 ◽  
pp. 1-11
Author(s):  
Rosy Pradhan ◽  
Mohammad Rafique Khan ◽  
Prabir Kumar Sethy ◽  
Santosh Kumar Majhi
Keyword(s):  
Information Theory ◽  
Quantum Information ◽  
Real World ◽  
Model Order Reduction ◽  
Order Reduction ◽  
Quantum Information Theory ◽  
Hunting Behavior ◽  
Model Order ◽  
Ant Lion Optimization ◽  
Real World Problems

The field of optimization science is proliferating that has made complex real-world problems easy to solve. Metaheuristics based algorithms inspired by nature or physical phenomena based methods have made its way in providing near-ideal (optimal) solutions to several complex real-world problems. Ant lion Optimization (ALO) has inspired by the hunting behavior of antlions for searching for food. Even with a unique idea, it has some limitations like a slower rate of convergence and sometimes confines itself into local solutions (optima). Therefore, to enhance its performance of classical ALO, quantum information theory is hybridized with classical ALO and named as QALO or quantum theory based ALO. It can escape from the limitations of basic ALO and also produces stability between processes of explorations followed by exploitation. CEC2017 benchmark set is adopted to estimate the performance of QALO compared with state-of-the-art algorithms. Experimental and statistical results demonstrate that the proposed method is superior to the original ALO. The proposed QALO extends further to solve the model order reduction (MOR) problem. The QALO based MOR method performs preferably better than other compared techniques. The results from the simulation study illustrate that the proposed method effectively utilized for global optimization and model order reduction.

Sign in / Sign up

Export Citation Format

Share Document