Posts

Showing posts from September 9, 2020

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 ...

Monoalphabetic Substitution Cipher Techniques

  Monoalphabetic Substitution Cipher, also known as a simple substitution cipher, relies (depends) on a fixed replacement structure. That is substitution is fixed for each letter of the alphabet.  A simple example is where each letter is encrypted as the next letter in the alphabet: "a simple message" becomes "B TJNQMF NFTTBHF". Each letter can be encrypted to any symbol [&,%,?,/,*,{},@,~,+,-] not just another letter. 1.) Additive Cipher The Simplest Monoalphabetic cipher is an Additive cipher. This cipher is sometimes called Shift Cipher. When the Cipher is Additive, the Plain Text, Cipher Text and key are integers in Z(26). For Encryption: C = (p + k) mod 26 For Decryption: P = (c - k) mod 26 Where, C = Cipher Text                   P = Plain Text                   k = Key  The secret key between Alice and Bob is also an integer value. The encryption Algorithm adds the key to t...
More posts