Posts

Showing posts from December 19, 2021

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 ...
Post a Comment
Read more

ALGORITHM DESIGN TECHNIQUES

-
Image
WHAT IS ALGORITHM DESIGN? Algorithm Design is a specific method to create mathematical process in solving various classical problems, real world complex problems. Techniques for designing and implementing algorithm design are design patterns. ALGORITHM DESIGN TECHNIQUES We have 5 base techniques that can be used to design any algorithm.  Divide and Conquer Greedy Method Dynamic Programming Back Tracking Branch and Bound WHAT IS DIVIDE AND CONQUER TECHNIQUE?  In branch and bound technique, we break the main problem into several sub-problems. Sub-problems are similar to original problem but smaller in size. To solve given problem algorithm call themselves to deal with subproblems. Once subproblems are solved recursively then combine these solutions to create a final solution for the original problem. Merge Sort Algorithm follow Divide and Conquer method. Step 01: Divide the main problem into subproblems [n/2]. Step 02: Solve the subproblems recursively.  Step 03: Combine th...
Post a Comment
Read more
More posts