Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model01:13

Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model

152
Drugs administered through various routes can lead to nonlinear elimination, resulting in complex pharmacokinetic behaviors crucial to understanding efficacious drug dosing.
When a drug is administered through a constant intravenous infusion and eliminated via nonlinear pharmacokinetics, it follows zero-order input. For example, oral drugs undergo first-order absorption upon administration and are eliminated through nonlinear pharmacokinetics.
In the case of subcutaneously administered drugs,...
152
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

134
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
134
Avoidance Learning and Learned Helplessness01:14

Avoidance Learning and Learned Helplessness

2.0K
Avoidance learning and learned helplessness are critical concepts in understanding behavioral responses to negative stimuli.
Avoidance learning occurs when an organism learns that a specific behavior can prevent an unpleasant outcome. For example, a student who receives a bad grade may start studying harder to avoid future poor grades. This behavior persists even when the negative outcome is no longer present. Avoidance learning is powerful because it maintains behavior in the absence of the...
2.0K
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

547
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
547
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.4K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.4K
Machines: Problem Solving II01:30

Machines: Problem Solving II

454
Machines are complex structures consisting of movable, pin-connected multi-force members that work together to transmit forces. Consider a lifting tong carrying a 100 kg load. It comprises movable sections DAF and CBG linked together with member AB.
454

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Exploring risk factors for long-term sickness absence during emerging adulthood: Continuous and discrete time models using Young-HUNT data on psychological distress and chronic pain.

International journal of medical informatics·2026
Same author

Improving Indirect Methods for Calculating Reference Limits for Nerve Conduction Studies From Historical Data.

Muscle & nerve·2026
Same author

Comprehensive dataset of features describing eye-gaze dynamics across multiple tasks.

Scientific data·2026
Same author

Disability pension during emerging adulthood: Insights from the young-HUNT study on psychological distress, chronic pain, and policy reform.

International journal of medical informatics·2025
Same author

Deriving reference limits from historical data - A comparison of four novel methods.

Clinical neurophysiology : official journal of the International Federation of Clinical Neurophysiology·2025
Same author

Chronic pain, psychological distress, and their co-occurrence in Norwegian young adults: Insights from machine learning and explainable AI.

International journal of medical informatics·2025
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
Same journal

CAFF-CIL: Causality-Aware Freedom Forgetting Approach for Class-Incremental Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Harmonic Autoencoding Framework for Multiple Tasks in Magnetic Particle Imaging Reconstruction.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Survey on Human-Centric Voice-Face Multimodal Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Vision-Assisted Foundation Model for Solving Multitask Vehicle Routing Problems.

IEEE transactions on neural networks and learning systems·2026
Same journal

FP3O: Enabling Proximal Policy Optimization in Multiagent Cooperation With Parameter-Sharing Versatility.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Oct 25, 2025

The HoneyComb Paradigm for Research on Collective Human Behavior
06:48

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

9.6K

Solving Two-Person Zero-Sum Stochastic Games With Incomplete Information Using Learning Automata With Artificial

Anis Yazidi, Daniel Silvestre, B John Oommen

    IEEE Transactions on Neural Networks and Learning Systems
    |August 4, 2021
    PubMed
    Summary
    This summary is machine-generated.

    This paper introduces a new method to solve complex two-person games where players lack full information. By using special learning machines with artificial barriers, the system avoids getting trapped in simple strategies and successfully finds optimal mixed solutions.

    Keywords:
    Nash equilibriumprobability simplexstochastic processesdecision algorithms

    Frequently Asked Questions

    More Related Videos

    An Automated T-maze Based Apparatus and Protocol for Analyzing Delay- and Effort-based Decision Making in Free Moving Rodents
    07:42

    An Automated T-maze Based Apparatus and Protocol for Analyzing Delay- and Effort-based Decision Making in Free Moving Rodents

    Published on: August 2, 2018

    13.9K
    The Double-H Maze: A Robust Behavioral Test for Learning and Memory in Rodents
    09:01

    The Double-H Maze: A Robust Behavioral Test for Learning and Memory in Rodents

    Published on: July 8, 2015

    12.8K

    Related Experiment Videos

    Last Updated: Oct 25, 2025

    The HoneyComb Paradigm for Research on Collective Human Behavior
    06:48

    The HoneyComb Paradigm for Research on Collective Human Behavior

    Published on: January 19, 2019

    9.6K
    An Automated T-maze Based Apparatus and Protocol for Analyzing Delay- and Effort-based Decision Making in Free Moving Rodents
    07:42

    An Automated T-maze Based Apparatus and Protocol for Analyzing Delay- and Effort-based Decision Making in Free Moving Rodents

    Published on: August 2, 2018

    13.9K
    The Double-H Maze: A Robust Behavioral Test for Learning and Memory in Rodents
    09:01

    The Double-H Maze: A Robust Behavioral Test for Learning and Memory in Rodents

    Published on: July 8, 2015

    12.8K

    Area of Science:

    • Computational intelligence and learning automata research
    • Game theory within decision science

    Background:

    No prior work had resolved the limitation of standard learning machines in finding mixed strategies for complex games. It was already known that these machines often converge exclusively to single actions. That uncertainty drove the development of absorbing barriers to modify convergence behavior. Prior research has shown that these barriers can support martingale properties in continuous estimation. However, the practical application of such mechanisms in game theory remains largely unexplored. This gap motivated researchers to investigate how these barriers function in stochastic environments. Previous algorithms struggled when games lacked a pure strategy saddle point. That failure limited the utility of existing models in competitive scenarios with incomplete information.

    Purpose Of The Study:

    The aim of this study is to provide an effective solution for solving two-person zero-sum stochastic games with incomplete information. Researchers address the inability of standard learning machines to converge to mixed Nash equilibria. This problem arises because most existing algorithms are absorbing and force the selection of a single action. The authors propose a new scheme that incorporates artificial barriers to overcome these limitations. They seek to avoid the common issue of the system becoming trapped in pure strategies. This work builds upon the linear reward-inaction paradigm to improve convergence accuracy. The study also intends to reduce the complexity of parameter tuning required by older penalty-based models. By doing so, the researchers provide a more efficient tool for complex decision-making environments.

    Main Methods:

    The review approach involves designing a novel algorithm based on the linear reward-inaction paradigm. Researchers integrate artificial barriers into the probability update process to modify convergence behavior. This design allows the system to navigate the probability simplex space without becoming trapped. The team performs rigorous mathematical derivations to establish the theoretical properties of the scheme. They conduct computational simulations to verify the accuracy of the proposed model. The study compares the performance of this new method against established penalty-based algorithms. Data collection focuses on the ability of the system to reach mixed Nash equilibria. The authors validate their findings through both analytical proofs and empirical testing.

    Main Results:

    The proposed algorithm successfully converges to optimal mixed Nash equilibria in games lacking pure strategy saddle points. This finding represents a significant improvement over traditional models that converge only to exclusive actions. The authors confirm that their scheme achieves these results with minimal parameter tuning. Theoretical proofs demonstrate that the system maintains a martingale property throughout the learning process. Experimental results validate the analytical findings across various test scenarios. The new method outperforms the linear reward-epsilon penalty scheme in terms of elegance and efficiency. The study confirms that artificial barriers effectively prevent the system from getting stuck in pure strategies. These results provide a robust solution for solving two-person zero-sum games with incomplete information.

    Conclusions:

    The authors demonstrate that their proposed scheme successfully identifies optimal mixed Nash equilibria. This approach overcomes the limitations of traditional models that converge only to pure strategies. By incorporating artificial barriers, the system avoids becoming trapped in exclusive action choices. The researchers provide theoretical proofs confirming the validity of their convergence results. Experimental evidence supports the claims made regarding the efficiency of the new algorithm. This method requires significantly less parameter tuning than older penalty-based schemes. The study offers a more elegant solution for handling stochastic games with limited information. These findings represent a significant advancement in the application of learning automata to complex decision-making problems.

    The researchers propose a linear reward-inaction paradigm modified with artificial barriers. This mechanism prevents the system from becoming trapped in pure strategies, allowing it to converge to optimal mixed Nash equilibria, unlike traditional absorbing schemes that force an exclusive choice of a single action.

    The authors utilize learning automata, which are computational machines designed for decision-making. These units are enhanced with artificial barriers to regulate probability updates, a concept that differs from the monotonicity-based proofs found in older continuous estimator algorithms.

    Artificial barriers are necessary to prevent the algorithm from getting stuck in pure strategies. While standard models rely on monotonicity, these barriers allow the system to maintain a martingale property, ensuring the model explores the probability simplex space effectively.

    The authors employ a linear reward-inaction paradigm to update action probabilities. This specific data-handling strategy is compared to the linear reward-epsilon penalty scheme, with the former requiring less parameter tuning and providing a more refined convergence behavior.

    The researchers measure the convergence of the algorithm to the game's Nash equilibrium. They contrast their results with previous models that could only identify saddle points in pure strategies, demonstrating that their method succeeds where earlier approaches failed.

    The authors claim that their new scheme offers a more elegant and efficient alternative to the linear reward-epsilon penalty approach. They suggest this method provides accurate solutions for complex stochastic games with incomplete information.