Posts

Showing posts from June, 2022

New Post

Nash Equilibrium In Game Theory ~xRay Pixy

Image
 Video Link  CLICK HERE... Learn Nash Equilibrium In Game Theory Step-By-Step Using Examples. Video Chapters: Nash Equilibrium  00:00 Introduction 00:19 Topics Covered 00:33 Nash Equilibrium  01:55 Example 1  02:30 Example 2 04:46 Game Core Elements 06:41 Types of Game Strategies 06:55  Prisoner’s Dilemma  07:17  Prisoner’s Dilemma Example 3 09:16 Dominated Strategy  10:56 Applications 11:34 Conclusion The Nash Equilibrium is a concept in game theory that describes a situation where no player can benefit by changing their strategy while the other players keep their strategies unchanged.  No player can increase their payoff by changing their choice alone while others keep theirs the same. Example : If Chrysler, Ford, and GM each choose their production levels so that no company can make more money by changing their choice, it’s a Nash Equilibrium Prisoner’s Dilemma : Two criminals are arrested and interrogated separately. Each has two ...

Aquila Optimization Algorithm Step-by-Step Explanation ~xRay Pixy

Image
  Video Chapters: Introduction: 00:00 Aquila Optimizer: 00:31 Aquila Hunting Methods: 02:09 Aquila Optimizer Steps: 03:33 Aquila Optimizer Mathematical Models: 06:07 Conclusion: 13:00 Aquila Optimization Algorithm is inspired by the Aquila Behavior in the nature. This algorithm is basically inspired by the aquilas hunting methods. How they catch their prey in the real life? Aquila Hunting Methods: Method 01: High Soar with Vertical Stoop. [i.e., Expanded Exploration] Method 02: Contour Flight with Short Glide Attack. [i.e., Narrowed Exploration] Method 03: Low Flight with Slow Decent Attack. [i.e., Expanded Exploitation] Method 04: Walking and Grab the Prey. [i.e., Narrowed Exploitation] Aquila Optimization Algorithm Steps: Step 01: Initialize Algorithm Parameters and Population Randomly. Step 02: Check While (Current Iteration <= Maximum Iteration) Step 03: Evaluate Agents Performance using Fitness Function. Step 04: For all agents update Location mean value. Step 05: Update Le...

Cat and Mouse Optimization Algorithm

Image
 Cat and Mouse Optimization Algorithm (CMOA) Cat and Mouse Optimization Algorithm is a population based metaheuristic optimization algorithm. Cat and Mouse Optimization Algorithm mimic the natural behavior of Cat attack on the mouse and Mouse escape from the Cat. In this algorithm population is divided into 2 groups: Group of Cats and Group of Mice . Cat and Mice scan the whole search space in this algorithm with their random movements. Each member in the population is a solution to the given problem. Initial population is evaluated using objective function and based on their fitness values population is sorted. Best values in the population as calculated using objective function are considered as Population for Mice and worst values in the population are considered as Population for Cats . Position Update Procedure in Cat and Mouse Optimization Algorithm (CMOA): Position Update in CMOA is divided into 2 phases as given below: First, Move Cats Towards Mice. Second, Move Mic...
More posts