Falcon on a Cloudy Day A Ro Sham Bo Algorithm by Andrew Post.

Slides:



Advertisements
Similar presentations
Adversarial Search Chapter 6 Sections 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
Advertisements

An Introduction to Game Theory Part V: Extensive Games with Perfect Information Bernhard Nebel.
Building Agents for the Lemonade Game Using a Cognitive Hierarchy Population Model Michael Wunder Michael Kaisers Michael Littman John Yaros.
Adversarial Search Chapter 6 Section 1 – 4. Types of Games.
Mechanism Design without Money Lecture 1 Avinatan Hassidim.
C&O 355 Mathematical Programming Fall 2010 Lecture 12 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
Managerial Economics Game Theory for Oligopoly
Infinitely Repeated Games Econ 171. Finitely Repeated Game Take any game play it, then play it again, for a specified number of times. The game that is.
Lectures 7&8 Revisit Elections Now range is left-wing or right-wing politics. Candidate-Voter model Assume even distribution of voters. Voters will vote.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.
AI for Connect-4 (or other 2-player games) Minds and Machines.
Coye Cheshire & Andrew Fiore March 21, 2012 // Computer-Mediated Communication Collective Action and CMC: Game Theory Approaches and Applications.
Adversarial Search Chapter 5.
Cognitive Biases 2 Incomplete and Unrepresentative Data.
Games What is ‘Game Theory’? There are several tools and techniques used by applied modelers to generate testable hypotheses Modeling techniques widely.
Problem 5.31 Ryan H Kian L Jun Oh Y Starting Out:  Define a Round Robin Tournament:  A tournament in which each player plays every other player. There.
Use logic to teach the computer how to play a game
Game Theory Analysis Sidney Gautrau. John von Neumann is looked at as the father of modern game theory. Many other theorists, such as John Nash and John.
Monopoly 1 Please read the article at the web site In this article the.
Review: Game theory Dominant strategy Nash equilibrium
Static Games and Cournot Competition
1 Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
1 Section 2d Game theory Game theory is a way of thinking about situations where there is interaction between individuals or institutions. The parties.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Coye Cheshire & Andrew Fiore June 28, 2015 // Computer-Mediated Communication Game Theory, Games, and CMC.
Reinforcement Learning (1)
Two-Stage Games APEC 8205: Applied Game Theory Fall 2007.
Today: Some classic games in game theory
The Marriage Problem Finding an Optimal Stopping Procedure.
Texas Holdem Poker With Q-Learning. First Round (pre-flop) PlayerOpponent.
Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)
Confirmation Bias. Critical Thinking Among our critical thinking questions were: Does the evidence really support the claim? Is there other evidence that.
Game Theory, Strategic Decision Making, and Behavioral Economics 11 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the.
Games People Play. 11: Brinkmanship – The Tragic Tale of George and Saddam.
Introduction: Thinking Like an Economist 1 CHAPTER 2 CHAPTER 12 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the tactics.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
The Guide To Economic Thinking. People Choose. Most situations involve making choices. People evaluate the costs and benefits of different alternatives.
Z. Z Scissors Paper Stone  Scissors beats paper (cuts it)  Paper beats rock (wraps it)  Rock beats scissors (blunts it)  Showing the same is a draw.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Starcraft Opponent Modeling CSE 391: Intro to AI Luciano Cheng.
Math notebook, pencil and calculator Conditional Relative Frequencies and Association.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Mark Dunlop, Computer and Information Sciences, Strathclyde University 1 Algorithms & Complexity 5 Games Mark D Dunlop.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
McGraw-Hill/Irwin Copyright  2008 by The McGraw-Hill Companies, Inc. All rights reserved. GAME THEORY, STRATEGIC DECISION MAKING, AND BEHAVIORAL ECONOMICS.
Instructor: Vincent Conitzer
Experimental Economics NSF short course David Laibson August 11, 2005.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Lecture 15 – Decision making 1 Decision making occurs when you have several alternatives and you choose among them. There are two characteristics of good.
Section 2 – Ec1818 Jeremy Barofsky
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Game tree search Thanks to Andrew Moore and Faheim Bacchus for slides!
Game tree search Chapter 6 (6.1 to 6.3 and 6.6) cover games. 6.6 covers state of the art game players in particular. 6.5 covers games that involve uncertainty.
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
Graph Search II GAM 376 Robin Burke. Outline Homework #3 Graph search review DFS, BFS A* search Iterative beam search IA* search Search in turn-based.
More on Logic Today we look at the for loop and then put all of this together to look at some more complex forms of logic that a program will need The.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
Unpacking each and every strategy! THE MATHEMATICIAN’S TOOLBOX.
Oligopoly and Game Theory Topic Students should be able to: Use simple game theory to illustrate the interdependence that exists in oligopolistic.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
The Prisoner’s Dilemma or Life With My Brother and Sister John CT.
OPPONENT EXPLOITATION Tuomas Sandholm. Traditionally two approaches to tackling games Game theory approach (abstraction+equilibrium finding) –Safe in.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
Mixed Strategies Keep ‘em guessing.
Adversarial Search Chapter 5.
Instructor: Vincent Conitzer
Game Theory and Strategic Play
Presentation transcript:

Falcon on a Cloudy Day A Ro Sham Bo Algorithm by Andrew Post

Lets Review If you missed my previous presentation: If you missed my previous presentation: Ro Sham Bo = Rock Paper Scissors Ro Sham Bo = Rock Paper Scissors Can be more complicated though Can be more complicated though Ro Sham Bo has important applications Ro Sham Bo has important applications Algorithms compete at Ro Sham Bo in tournaments Algorithms compete at Ro Sham Bo in tournaments Iocaine Powder is the world champ of Ro Sham Bo Iocaine Powder is the world champ of Ro Sham Bo Because it uses ‘Sicilian Reasoning’ Because it uses ‘Sicilian Reasoning’ I will beat Iocaine Powder I will beat Iocaine Powder Eventually… Eventually…

What is Ro Sham Bo? Also known as Rock Paper Scissors Also known as Rock Paper Scissors

What is Ro Sham Bo? Generalized case of Rock Paper Scissors actually Generalized case of Rock Paper Scissors actually Not always three choices Not always three choices Ties can be resolved differently Ties can be resolved differently The game is not necessarily zero-sum The game is not necessarily zero-sum

Why does it matter? Many competitive scenarios involve a Ro Sham Bo Many competitive scenarios involve a Ro Sham Bo Example: Example: CBS and NBC choosing Primetime TV Shows CBS and NBC choosing Primetime TV Shows They can choose to show a Drama, Comedy, or Sports show They can choose to show a Drama, Comedy, or Sports show Viewers prefer Comedy to Drama, Sports to Comedy, and Drama to Sports, given the choice. Viewers prefer Comedy to Drama, Sports to Comedy, and Drama to Sports, given the choice. Neither station knows ahead of time what the other will choose Neither station knows ahead of time what the other will choose Billions of dollars every day rely on decisions like these. Billions of dollars every day rely on decisions like these.

How it works Simplest Non-Cooperative Game Simplest Non-Cooperative Game Players cannot play to ensure they both win Players cannot play to ensure they both win Governed by the Nash Equilibrium Governed by the Nash Equilibrium There are strategies which cannot be dominated There are strategies which cannot be dominated 1: :20 1: :20

How to Win As you just heard, playing randomly can ensure you don’t lose, but how do you win? As you just heard, playing randomly can ensure you don’t lose, but how do you win? How to predict your opponent How to predict your opponent Sub-Optimal Frequency Distributions Sub-Optimal Frequency Distributions Pattern Matching Pattern Matching History Analysis History Analysis

Iocaine Powder International Ro Sham Bo Programming Tournament Champion International Ro Sham Bo Programming Tournament Champion Named for this famous scene: 0: :20 Named for this famous scene: 0: :20

The Tournament Tournament programs play thousands of rounds Tournament programs play thousands of rounds Win by beating the most opponents by a large margin Win by beating the most opponents by a large margin Most programs play sub-optimally, so exploiting your opponent is more important than playing randomly to avoid losing. Most programs play sub-optimally, so exploiting your opponent is more important than playing randomly to avoid losing.

Iocaine Powder IP is the algorithm which does this best. IP is the algorithm which does this best. IP uses the same heuristics to predict what an opponent is most likely to do. IP uses the same heuristics to predict what an opponent is most likely to do. Using the same tools, how can you be better? Using the same tools, how can you be better? Sicilian Reasoning!

Sicilian Reasoning Levels of second guessing: Levels of second guessing: 1. Opponent will play rock, so play paper 2. Opponent knows you will counter rock with paper, and play scissors – so play rock 3. Opponent knows all this, and will now play paper to beat your rock – so play scissors 4. Opponent will play rock again – same as 1

Sicilian Reasoning Use your predictive strategies to evaluate what is going to happen next. Use your predictive strategies to evaluate what is going to happen next. Run SR on yourself and your opponent, and keep a table of what each of the six levels of reasoning say you should do. Run SR on yourself and your opponent, and keep a table of what each of the six levels of reasoning say you should do. Pick the level of reasoning which would have won against what your opponent actually did the most often. Pick the level of reasoning which would have won against what your opponent actually did the most often.

Wait, six? Don’t you mean three? You can use the same predictive tools that your opponent uses to ‘predict’ what you are going to do. You can use the same predictive tools that your opponent uses to ‘predict’ what you are going to do. Now you have three more levels of SR: Now you have three more levels of SR: 4. I will play rock. So he plays paper. So play Scissors 5. He knows I will counter with scissors, and play rock. So play Paper. 6. He expects me to counter-counter with paper, and will play scissors. So play rock.

More Sicilian Reasoning Just because one level of SR is winning now, doesn’t mean it always will be. Just because one level of SR is winning now, doesn’t mean it always will be. Opponents will change how they play if they are losing, so you must change too! Opponents will change how they play if they are losing, so you must change too! How do you switch your level of SR? How do you switch your level of SR?

Switching Reasoning SR-2 has just won the first 100 rounds SR-2 has just won the first 100 rounds Opponent changes strategy Opponent changes strategy You lose 50 rounds before SR-4 has more than 100 theoretical wins. You lose 50 rounds before SR-4 has more than 100 theoretical wins. You just wasted 50 rounds! You just wasted 50 rounds!

Switching Reasoning Use several different methodologies for switches Use several different methodologies for switches Most wins in last 10, 25, 50, 100, 1000 rounds Most wins in last 10, 25, 50, 100, 1000 rounds Has won the most in similar situations Has won the most in similar situations Causes the opponent to switch to a worse strategy Causes the opponent to switch to a worse strategy

Switching Reasoning Here is the real genius – now use the switching methodology which has helped you win the most rounds! Here is the real genius – now use the switching methodology which has helped you win the most rounds!

Falcon on a Cloudy Day So you ask, how do you beat Iocaine Powder? So you ask, how do you beat Iocaine Powder? Improve the basic predictive heuristics Improve the basic predictive heuristics Extend Sicilian Reasoning Extend Sicilian Reasoning

Improving Prediction What I have implemented: What I have implemented: Improved Variable History Analysis Improved Variable History Analysis Look at just your history, your opponents, or both Look at just your history, your opponents, or both Improved Frequency Analysis Improved Frequency Analysis EV[x] = Pr[x+2] - Pr[x+1] EV[x] = Pr[x+2] - Pr[x+1]

Demonstration Here is how my project does with what is implemented so far. Here is how my project does with what is implemented so far.

Improving Prediction What I have not implemented yet: What I have not implemented yet: Improved Pattern Matching Improved Pattern Matching Markov Models with MegaHAL Markov Models with MegaHAL Extended Sicilian Reasoning Extended Sicilian Reasoning

More on MegaHAL MegaHAL is a very simple "infinite-order" Markov model. MegaHAL is a very simple "infinite-order" Markov model. Stores frequency information about the moves the opponent has made in the past for all possible contexts Stores frequency information about the moves the opponent has made in the past for all possible contexts Using the ‘context’ of the last few moves, the “appropriate” response is then selected. Using the ‘context’ of the last few moves, the “appropriate” response is then selected.

Extended Sicilian Reasoning Q: Isn’t Sicilian Reasoning complete at 6? Q: Isn’t Sicilian Reasoning complete at 6? A: Yes, but there is information we are ignoring. A: Yes, but there is information we are ignoring. By compressing your strategy decisions into the idea of which of six strategies is best right now, you have no way to keep track of how changing your strategies has paid off best in the past. By compressing your strategy decisions into the idea of which of six strategies is best right now, you have no way to keep track of how changing your strategies has paid off best in the past.

Now for some Math Hilbert Space Hilbert Space Game Trajectory and Game State Game Trajectory and Game State Projection Operators Projection Operators Annotated History Analysis Annotated History Analysis Project Enigma Project Enigma