Lecture 2. Sequential Equilibrium

Size: px
Start display at page:

Download "Lecture 2. Sequential Equilibrium"

Transcription

1 ECON601 Spring, 2015 UBC Li, Hao Lecture 2. Sequential Equilibrium Strategies and beliefs Applying idea of subgame perfection of extensive games with perfect information to extensive games with imperfect information: each player s strategy has to be optimal at each of his information sets. An example of what this requirement buys us: Figure 219.1, O&R. An example of the deficiency of this requirement: Figure 220.1, O&R. The need to include beliefs as part of solution concept: unlike in extensive games with perfect information, belief about history of the play is important in determining optimal strategy at an information set. 1

2 Ideas behind sequential equilibrium Sequential equilibrium consists of a behavioral strategy profile, as in extensive games with perfect information, and a new component, called a belief system that assigns a probability distribution over each information set. Two requirements: sequential rationality and belief consistency. Sequential rationality is an extension of subgame perfection in extensive games with perfect information. At each information set, given the belief assigned by the belief system, the player chooses optimally among his available actions. As in extensive games of perfect information, this requirement applies to all information sets, not just those reached according to the strategy profile under consideration ( on the path ). 2

3 Belief consistency has the following components. Consistency with strategies, as in Nash equilibrium: for each information set on the path, the belief at the information set must be derived using Bayes rule Figure 220.1, O&R. Consistency with the extensive game form: For an information set not reached according to the strategy profile under consideration ( off the path ), the belief at the information set can be generated by some alternative strategy profile using Bayes rule. Consistency with each other: The beliefs for information sets off the path do not contradict each other. Remarks: Consistency with strategies is minimal, but the other two are less natural. Often sequential equilibrium does not do enough for beliefs off the path. 3

4 Sequential equilibrium Definition. An assessment in extensive game is a pair (β, µ), where β is a behavioral strategy profile, and µ is a belief system that assigns to every information set a probability measure on the set of histories in the information set. Let (β, µ) be an assessment in N, H, P, f c, (I i ), ( i ). µ(i)(h) denotes the probability that player P(I) assigns to the history h I, conditional on I being reached, where P(I) is the player to whom I is assigned. Sequential rationality. Let outcome O(β, µ I) be the distribution over the set Z of terminal histories by assessment (β, µ) conditional on information set I having been reached: for any terminal history h = (a 1,..., a K ), if a subhistory h = (a 1,..., a L ) of h is in I then O(β, µ I)(h ) = µ(i)(h) K 1 k=l β P(a 1,...,a k ) (a1,..., a k )(a k+1 ); and if there is no subhistory of h in I, then O(β, µ I)(h ) = 0. 4

5 Definition. Fix an extensive game N, H, P, f c, (I i ), ( i ). An assessment (β, µ) is sequentially rational if for every player i N and every information set I i I i, we have O(β, µ I i ) i O((β i, β i ), µ I i) for every strategy β i of player i. Sequential rationality is minimum requirement to refine Nash equilibrium in extensive games with imperfect information. Belief consistency. We say that a behavioral strategy profile is completely mixed if it assigns strictly positive probability to every available action at every information set. Definition. Fix an extensive game N, H, P, f c, (I i ), ( i ). An assessment (β, µ) is consistent if there is a sequence ((β n, µ n )) n=1 of assessments that converges to (β, µ) and has the properties that each strategy profile β n is completely mixed and that each belief system µ n is derived from β n using Bayes rule. 5

6 Remarks: The idea is to use convergence and consistency of belief system with strategies to assign beliefs conditional on unexpected events: this way of imposing belief consistency is a very specific way of meeting consistency with extensive game form and consistency with each other. An alternative way of imposing belief consistency is structural consistency: belief system µ in an extensive game is structurally consistent if for every information set I there is a strategy profile β with the properties that I is reached with positive probability under β and µ(i) is derived from β using Bayes rule. Since belief system under consistency uses the same perturbation to generate beliefs at all information sets, and since different strategy profiles may be used to justify beliefs at different information sets, belief systems that are struturally consistent may not be consistent. More surprisingly, a consistent belief system may not be structurally consistent. 6

7 Definition. An assessment is a sequential equilibrium of an extensive game if it is sequentially rational and consistent. Remarks: A sequential equilibrium strategy profile is a Nash equilibrium. Sequential equilibrium is equivalent to subgame perfect equilibrium in games with perfect information. Verifying sequential equilibrium Figure 220.1, O&R Example 225.2, O&R Example 226.2, O&R An example of sequential equilibrium not being structurally consistent: Example 228.2, O&R 7

6 Extensive Form Games

6 Extensive Form Games 6 Extensive Form Games 6.1 Example: Representing a Simultaneous 22 Game Alice H HHHH O H HH o Q Bob H QQQ h o HHHH h 2 1 1 2 Figure 1: The Battle of the Sexes in Extensive Form So far we have described

More information

Extensive Games with Imperfect Information

Extensive Games with Imperfect Information Extensive Games with Imperfect Information Definition (Os 314.1): An extensive game with imperfect information consists of a set of players N a set of terminal histories H; no sequence is a proper subhistory

More information

Stochastic Coalitional Games with Constant Matrix of Transition Probabilities

Stochastic Coalitional Games with Constant Matrix of Transition Probabilities Applied Mathematical Sciences, Vol. 8, 2014, no. 170, 8459-8465 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410891 Stochastic Coalitional Games with Constant Matrix of Transition Probabilities

More information

Sequential Equilibrium in Games of Imperfect Recall

Sequential Equilibrium in Games of Imperfect Recall Sequential Equilibrium in Games of Imperfect Recall Joseph Y. Halpern Cornell University halpern@cs.cornell.edu Rafael Pass Cornell University rafael@cs.cornell.edu First version: October, 2008 This version:

More information

Sequential Equilibrium in Games of Imperfect Recall

Sequential Equilibrium in Games of Imperfect Recall Proceedings, Fifteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2016) Sequential Equilibrium in Games of Imperfect Recall Joseph Y. Halpern Cornell University

More information

CAP 5993/CAP 4993 Game Theory. Instructor: Sam Ganzfried

CAP 5993/CAP 4993 Game Theory. Instructor: Sam Ganzfried CAP 5993/CAP 4993 Game Theory Instructor: Sam Ganzfried sganzfri@cis.fiu.edu 1 Announcements HW 1 due today HW 2 out this week (2/2), due 2/14 2 Definition: A two-player game is a zero-sum game if for

More information

Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy.

Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy. Algorithmic Game Theory and Applications Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy Kousha Etessami games and the internet Basic idea: The internet is a huge experiment

More information

Multiple Agents. Why can t we all just get along? (Rodney King) CS 3793/5233 Artificial Intelligence Multiple Agents 1

Multiple Agents. Why can t we all just get along? (Rodney King) CS 3793/5233 Artificial Intelligence Multiple Agents 1 Multiple Agents Why can t we all just get along? (Rodney King) CS 3793/5233 Artificial Intelligence Multiple Agents 1 Assumptions Assumptions Definitions Partially bservable Each agent can act autonomously.

More information

Solving Large Imperfect Information Games Using CFR +

Solving Large Imperfect Information Games Using CFR + Solving Large Imperfect Information Games Using CFR + Oskari Tammelin ot@iki.fi July 16, 2014 Abstract Counterfactual Regret Minimization and variants (ie. Public Chance Sampling CFR and Pure CFR) have

More information

A game theoretic framework for distributed self-coexistence among IEEE networks

A game theoretic framework for distributed self-coexistence among IEEE networks A game theoretic framework for distributed self-coexistence among IEEE 82.22 networks S. Sengupta and R. Chandramouli Electrical and Computer Engineering Stevens Institute of Technology Hoboken, NJ 73

More information

Kapitel 5: Local Search

Kapitel 5: Local Search Inhalt: Kapitel 5: Local Search Gradient Descent (Hill Climbing) Metropolis Algorithm and Simulated Annealing Local Search in Hopfield Neural Networks Local Search for Max-Cut Single-flip neighborhood

More information

Subgame Perfect Equilibrium

Subgame Perfect Equilibrium Subgame Perfect Equilibrium Felix Munoz-Garcia Strategy and Game Theory - Washington State University Sequential Move Games Road Map: Rules that game trees must satisfy. How to incorporate sequential rationality

More information

Vertical Handover Decision Strategies A double-sided auction approach

Vertical Handover Decision Strategies A double-sided auction approach Vertical Handover Decision Strategies A double-sided auction approach Working paper Hoang-Hai TRAN Ph.d student DIONYSOS Team INRIA Rennes - Bretagne Atlantique 1 Content Introduction Handover in heterogeneous

More information

Solutions of Stochastic Coalitional Games

Solutions of Stochastic Coalitional Games Applied Mathematical Sciences, Vol. 8, 2014, no. 169, 8443-8450 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410881 Solutions of Stochastic Coalitional Games Xeniya Grigorieva St.Petersburg

More information

Algorithms for Computing Strategies in Two-Player Simultaneous Move Games

Algorithms for Computing Strategies in Two-Player Simultaneous Move Games Algorithms for Computing Strategies in Two-Player Simultaneous Move Games Branislav Bošanský 1a, Viliam Lisý a, Marc Lanctot 2b, Jiří Čermáka, Mark H.M. Winands b a Agent Technology Center, Department

More information

Beyond Minimax: Nonzero-Sum Game Tree Search with Knowledge Oriented Players

Beyond Minimax: Nonzero-Sum Game Tree Search with Knowledge Oriented Players Beyond Minimax: Nonzero-Sum Game Tree Search with Knowledge Oriented Players Tian Sang & Jiun-Hung Chen Department of Computer Science & Engineering University of Washington AAAI Metareasoning Workshop,

More information

EC422 Mathematical Economics 2

EC422 Mathematical Economics 2 EC422 Mathematical Economics 2 Chaiyuth Punyasavatsut Chaiyuth Punyasavatust 1 Course materials and evaluation Texts: Dixit, A.K ; Sydsaeter et al. Grading: 40,30,30. OK or not. Resources: ftp://econ.tu.ac.th/class/archan/c

More information

Sequential Two-Prize Contests

Sequential Two-Prize Contests Sequential Two-Prize Contests Aner Sela September, 2009 Abstract We study two-stage all-pay auctions with two identical prizes. In each stage, the players compete for one prize. Each player may win either

More information

Modelling Routing in Wireless Ad Hoc Networks with Dynamic Bayesian Games

Modelling Routing in Wireless Ad Hoc Networks with Dynamic Bayesian Games Modelling Routing in Wireless Ad Hoc Networks with Dynamic Bayesian Games Petteri Nurmi 1 Helsinki Institute for Information Technology (HIIT) / Basic Research Unit Department of Computer Science, P.O.

More information

Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy

Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy Algorithmic Game Theory and Applications Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy Kousha Etessami warning, again 1 In the few remaining lectures, we will briefly

More information

Modeling Misbehavior in Ad Hoc Networks: A Game Theoretic Approach for Intrusion Detection

Modeling Misbehavior in Ad Hoc Networks: A Game Theoretic Approach for Intrusion Detection Modeling Misbehavior in Ad Hoc Networks: A Game Theoretic Approach for Intrusion Detection Y. Liu*, C. Comaniciu, H. Man Department of Electrical and Computer Engineering, Stevens Institute of Technology

More information

Optimal Routing Control: Repeated Game Approach

Optimal Routing Control: Repeated Game Approach IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 47, NO. 3, MARCH 2002 437 Optimal Routing Control: Repeated Game Approach Richard J. La and Venkat Anantharam, Fellow, IEEE Abstract Communication networks

More information

MIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns

MIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns MIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns This is a closed-book exam. You should have no material on your desk other than the exam itself and a pencil or pen.

More information

Privacy Consensus in Anonymization Systems Via Game Theory

Privacy Consensus in Anonymization Systems Via Game Theory Privacy Consensus in Anonymization Systems Via Game Theory Rosa Karimi Adl, Mina Askari, Ken Barker, and Reihaneh Safavi-Naini Department of Computer Science, University of Calgary, Canada {rkarimia,maskari,kbarker,rei}@ucalgary.ca

More information

Strategic Network Formation

Strategic Network Formation Strategic Network Formation Zhongjing Yu, Big Data Research Center, UESTC Email:junmshao@uestc.edu.cn http://staff.uestc.edu.cn/shaojunming What s meaning of Strategic Network Formation? Node : a individual.

More information

A Signaling Game Approach to Databases Querying

A Signaling Game Approach to Databases Querying A Signaling Game Approach to Databases Querying Ben McCamish 1, Arash Termehchy 1, Behrouz Touri 2, and Eduardo Cotilla-Sanchez 1 1 School of Electrical Engineering and Computer Science, Oregon State University

More information

Bargaining and Coalition Formation

Bargaining and Coalition Formation 1 These slides are based largely on Chapter 18, Appendix A of Microeconomic Theory by Mas-Colell, Whinston, and Green. Bargaining and Coalition Formation Dr James Tremewan (james.tremewan@univie.ac.at)

More information

Uncertainty Regarding Interpretation of the `Negligence Rule' and Its Implications for the Efficiency of Outcomes

Uncertainty Regarding Interpretation of the `Negligence Rule' and Its Implications for the Efficiency of Outcomes Jawaharlal Nehru University From the SelectedWorks of Satish K. Jain 2011 Uncertainty Regarding Interpretation of the `Negligence Rule' and Its Implications for the Efficiency of Outcomes Satish K. Jain,

More information

Comment on Strategic Information Management Under Leakage in a. Supply Chain

Comment on Strategic Information Management Under Leakage in a. Supply Chain Comment on Strategic Information Management Under Leakage in a Supply Chain Lin Tian 1 School of International Business Administration, Shanghai University of Finance and Economics, 00433 Shanghai, China,

More information

DEFERRED ACCEPTANCE 2

DEFERRED ACCEPTANCE 2 DEFERRED ACCEPTANCE The point of this note is to take you through the logic behind the deferred acceptance algorithm. Please read the papers associated with the links on the web page for motivation and

More information

A Game-Theoretic Model for Defending Against Malicious Users in RecDroid

A Game-Theoretic Model for Defending Against Malicious Users in RecDroid A Game-Theoretic Model for Defending Against Malicious Users in RecDroid Bahman Rashidi Carol Fung Department of Computer Science Virginia Commonwealth University Richmond, VA, USA {rashidib, cfung}@vcu.edu

More information

approach is to rely on individuals in a system to select tasks themselves. Both approaches

approach is to rely on individuals in a system to select tasks themselves. Both approaches Chapter 5 Task Routing Engaging a crowd to tackle complex tasks relies not only on effective coordination, but on recruiting individuals with relevant expertise to join the problem-solving effort. One

More information

On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games

On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games Bruno Codenotti Daniel Štefankovič Abstract The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix

More information

The College Admissions Problem Reconsidered

The College Admissions Problem Reconsidered The College Admissions Problem Reconsidered Zhenhua Jiao School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China Guoqiang Tian Department of Economics Texas A&M University

More information

CSE 490R P1 - Localization using Particle Filters Due date: Sun, Jan 28-11:59 PM

CSE 490R P1 - Localization using Particle Filters Due date: Sun, Jan 28-11:59 PM CSE 490R P1 - Localization using Particle Filters Due date: Sun, Jan 28-11:59 PM 1 Introduction In this assignment you will implement a particle filter to localize your car within a known map. This will

More information

On the Structure of Weakly Acyclic Games

On the Structure of Weakly Acyclic Games 1 On the Structure of Weakly Acyclic Games Alex Fabrikant (Princeton CS Google Research) Aaron D. Jaggard (DIMACS, Rutgers Colgate University) Michael Schapira (Yale CS & Berkeley CS Princeton CS) 2 Best-

More information

AN ad-hoc network is a group of nodes without requiring

AN ad-hoc network is a group of nodes without requiring 240 IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 2, NO. 2, JUNE 2007 Securing Cooperative Ad-Hoc Networks Under Noise and Imperfect Monitoring: Strategies and Game Theoretic Analysis Wei

More information

MAY 2009 EXAMINATIONS. Multiagent Systems

MAY 2009 EXAMINATIONS. Multiagent Systems COMP310 DEPARTMENT : Computer Science Tel. No. 7790 MAY 2009 EXAMINATIONS Multiagent Systems TIME ALLOWED : Two and a Half hours INSTRUCTIONS TO CANDIDATES Answer four questions. If you attempt to answer

More information

Algorithmic Game Theory. Alexander Skopalik

Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory Alexander Skopalik Today 1. Strategic games (Normal form games) Complexity 2. Zero Sum Games Existence & Complexity Outlook, next week: Network Creation Games Guest lecture by Andreas

More information

Algorithmic Game Theory - Introduction, Complexity, Nash

Algorithmic Game Theory - Introduction, Complexity, Nash Algorithmic Game Theory - Introduction, Complexity, Nash Branislav Bošanský Czech Technical University in Prague branislav.bosansky@agents.fel.cvut.cz February 25, 2018 About This Course main topics of

More information

A BAYESIAN GAME APPROACH TO COEXISTENCE WITH MALICIOUS AND SELFISH NODES IN WIRELESS AD-HOC NETWORKS

A BAYESIAN GAME APPROACH TO COEXISTENCE WITH MALICIOUS AND SELFISH NODES IN WIRELESS AD-HOC NETWORKS A BAYESIAN GAME APPROACH TO COEXISTENCE WITH MALICIOUS AND SELFISH NODES IN WIRELESS AD-HOC NETWORKS By J. ANDREW ROLES A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE

More information

Extensive games with imperfect information

Extensive games with imperfect information Extensive games with impefect infomation ECON500 Advanced micoeconomics ectues in game theoy Fall 0, Pat 3 7.07.0 G.. Asheim, ECON500-3 Incomplete Complete infomation infomation Pefect infomation Impefect

More information

Pay-per-download or Freemium: Revenue Models in a Competitive Mobile App Market

Pay-per-download or Freemium: Revenue Models in a Competitive Mobile App Market Proceedings of the 51 st Hawaii International Conference on System Sciences 2018 Pay-per-download or Freemium: Revenue Models in a Competitive Mobile App Market Xiaoxiao Luo Tianjin University luoxiaoxiao@tju.edu.cn

More information

A Game Theoretic Investigation of Deception in Network Security

A Game Theoretic Investigation of Deception in Network Security Game heoretic Investigation of Deception in Network Security homas E. Carroll Department of Computer Science, ayne State University 5143 Cass venue, Detroit, MI 48202 US. Email: tec@cs.wayne.edu Daniel

More information

Equilibrium Computation for Two-Player Games in Strategic and Extensive Form

Equilibrium Computation for Two-Player Games in Strategic and Extensive Form CHAPTER 3 Equilibrium Computation for Two-Player Games in Strategic and Extensive Form Bernhard von Stengel Abstract We explain algorithms for computing Nash equilibria of two-player games given in strategic

More information

Efficiency and Respecting Improvements in College Admissions

Efficiency and Respecting Improvements in College Admissions Efficiency and Respecting Improvements in College Admissions Zhenhua Jiao School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China Guoqiang Tian Department of Economics

More information

Sufficiently Secure Peer-to-Peer Networks

Sufficiently Secure Peer-to-Peer Networks Rupert Gatti 1 Stephen Lewis 2 Andy Ozment 2 Thierry Rayna 1 Andrei Serjantov 2 1 Faculty of Economics and Politics University of Cambridge 2 Computer Laboratory University of Cambridge The Third Annual

More information

A Series of Lectures on Approximate Dynamic Programming

A Series of Lectures on Approximate Dynamic Programming A Series of Lectures on Approximate Dynamic Programming Dimitri P. Bertsekas Laboratory for Information and Decision Systems Massachusetts Institute of Technology Lucca, Italy June 2017 Bertsekas (M.I.T.)

More information

Lecture Notes on Congestion Games

Lecture Notes on Congestion Games Lecture Notes on Department of Computer Science RWTH Aachen SS 2005 Definition and Classification Description of n agents share a set of resources E strategy space of player i is S i 2 E latency for resource

More information

CSE151 Assignment 2 Markov Decision Processes in the Grid World

CSE151 Assignment 2 Markov Decision Processes in the Grid World CSE5 Assignment Markov Decision Processes in the Grid World Grace Lin A484 gclin@ucsd.edu Tom Maddock A55645 tmaddock@ucsd.edu Abstract Markov decision processes exemplify sequential problems, which are

More information

MEAM 550 Modeling and Design of MEMS Spring Solution to homework #3. In our notation and values, k = = =

MEAM 550 Modeling and Design of MEMS Spring Solution to homework #3. In our notation and values, k = = = MEAM 550 Modeling and Design of MEMS Spring 004 Solution to homework # Problem 1 A fixed-guided beam (length = l, width = b, depth = h ) with a transverse tip load of F has the following formulas for maximum

More information

Approximately Solving Sequential Games With Incomplete Information

Approximately Solving Sequential Games With Incomplete Information Approximately Solving Sequential Games With Incomplete Information Hala Mostafa and Victor Lesser Computer Science Department University of Massachusetts Amherst, MA 01003-4610 {hmostafa,lesser}@cs.umass.edu

More information

Lecture 19 Thursday, March 29. Examples of isomorphic, and non-isomorphic graphs will be given in class.

Lecture 19 Thursday, March 29. Examples of isomorphic, and non-isomorphic graphs will be given in class. CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 19 Thursday, March 29 GRAPH THEORY Graph isomorphism Definition 19.1 Two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) are isomorphic, write G 1 G

More information

CS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness

CS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness CS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness Tim Roughgarden December 2, 2013 1 The Big Picture We now have an impressive list of tractability results polynomial-time

More information

Math Centers for Common Core. Numbers and Operations: Fractions. Created by Jennifer Findley

Math Centers for Common Core. Numbers and Operations: Fractions. Created by Jennifer Findley Math Centers for Common Core Numbers and Operations: Fractions Created by Jennifer Findley Common Core Alignment.NF. Add and subtract fractions with unlike denominators (including mixed numbers) by replacing

More information

Two-player Games ZUI 2016/2017

Two-player Games ZUI 2016/2017 Two-player Games ZUI 2016/2017 Branislav Bošanský bosansky@fel.cvut.cz Two Player Games Important test environment for AI algorithms Benchmark of AI Chinook (1994/96) world champion in checkers Deep Blue

More information

Bayesian Action-Graph Games

Bayesian Action-Graph Games Bayesian Action-Graph Games Albert Xin Jiang and Kevin Leyton-Brown Department of Computer Science University of British Columbia November 13, 2011 Equilibrium Computation in Bayesian Games Equilibrium

More information

More Realistic Adversarial Settings. Virginia Tech CS5804 Introduction to Artificial Intelligence Spring 2015

More Realistic Adversarial Settings. Virginia Tech CS5804 Introduction to Artificial Intelligence Spring 2015 More Realistic Adversarial Settings Virginia Tech CS5804 Introduction to Artificial Intelligence Spring 2015 Review Minimax search How to adjust for more than two agents, for non-zero-sum Analysis very

More information

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n. Math 532, 736I: Modern Geometry Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel Part 1: 1. Axioms for a finite AFFINE plane of order n. AA1: There exist at least 4 points, no

More information

Finding Gale Strings

Finding Gale Strings Electronic Notes in Discrete Mathematics 36 (2010) 1065 1072 Finding Gale Strings Marta M. Casetti, Julian Merschen, Bernhard von Stengel Dept. of Mathematics, London School of Economics, London WC2A 2AE,

More information

Finding optimal configurations Adversarial search

Finding optimal configurations Adversarial search CS 171 Introduction to AI Lecture 10 Finding optimal configurations Adversarial search Milos Hauskrecht milos@cs.pitt.edu 39 Sennott Square Announcements Homework assignment is out Due on Thursday next

More information

The Strategic Justification for BGP

The Strategic Justification for BGP MPRA Munich Personal RePEc Archive The Strategic Justification for BGP Hagay Levin and Michael Schapira and Aviv Zohar The Hebrew University of Jerusalem 20. November 2006 Online at http://mpra.ub.uni-muenchen.de/2110/

More information

Lecture 1: Sperner, Brouwer, Nash. Philippe Bich, PSE and University Paris 1 Pantheon-Sorbonne, France. Lecture 1: Sperner, Brouwer, Nash

Lecture 1: Sperner, Brouwer, Nash. Philippe Bich, PSE and University Paris 1 Pantheon-Sorbonne, France. Lecture 1: Sperner, Brouwer, Nash .., PSE and University Paris 1 Pantheon-Sorbonne, France. 1. Simplex A n-simplex (or simplex of dimension n) is (x 0,...x n ) = { n i=0 λ ix i : (λ 0,..., λ n ) R n+1 + : n i=0 λ i = 1}, where x 0,...,

More information

The Strategic Justification for BGP

The Strategic Justification for BGP The Strategic Justification for BGP Hagay Levin Michael Schapira Aviv Zohar Abstract The Internet consists of many administrative domains, or Autonomous Systems (ASes), each owned by an economic entity

More information

Constraint Satisfaction Algorithms for Graphical Games

Constraint Satisfaction Algorithms for Graphical Games Constraint Satisfaction Algorithms for Graphical Games Vishal Soni soniv@umich.edu Satinder Singh baveja@umich.edu Computer Science and Engineering Division University of Michigan, Ann Arbor Michael P.

More information

ABSTRACT. Zhu Ji, Doctor of Philosophy, Dissertation directed by: Professor K. J. Ray Liu Department of Electrical and Computer Engineering

ABSTRACT. Zhu Ji, Doctor of Philosophy, Dissertation directed by: Professor K. J. Ray Liu Department of Electrical and Computer Engineering ABSTRACT Title of Dissertation: GAME THEORETICAL FRAMEWORK FOR COOPERATION IN AUTONOMOUS WIRELESS NETWORKS Zhu Ji, Doctor of Philosophy, 2007 Dissertation directed by: Professor K. J. Ray Liu Department

More information

Mathematical preliminaries and error analysis

Mathematical preliminaries and error analysis Mathematical preliminaries and error analysis Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan August 28, 2011 Outline 1 Round-off errors and computer arithmetic IEEE

More information

The Query Complexity of Correlated Equilibria

The Query Complexity of Correlated Equilibria The Query Complexity of Correlated Equilibria Sergiu Hart Noam Nisan May 17, 2013 Abstract We consider the complexity of finding a Correlated Equilibrium in an n-player game in a model that allows the

More information

Today s lecture. Competitive Matrix Games. Competitive Matrix Games. Modeling games as hybrid systems. EECE 571M/491M, Spring 2007 Lecture 17

Today s lecture. Competitive Matrix Games. Competitive Matrix Games. Modeling games as hybrid systems. EECE 571M/491M, Spring 2007 Lecture 17 EECE 57M/49M, Spring 007 Lecture 7 Modeling games as hybrid systems oday s lecture Background Matrix games Nash Competitive Equilibrium Nash Bargaining Solution Strategy dynamics: he need for hybrid models

More information

Integers and Rational Numbers

Integers and Rational Numbers A A Family Letter: Integers Dear Family, The student will be learning about integers and how these numbers relate to the coordinate plane. The set of integers includes the set of whole numbers (0, 1,,,...)

More information

The Query Complexity of Correlated Equilibria

The Query Complexity of Correlated Equilibria The Query Complexity of Correlated Equilibria Sergiu Hart September 2015 SERGIU HART c 2015 p. 1 The Query Complexity of Correlated Equilibria Sergiu Hart Center for the Study of Rationality Dept of Mathematics

More information

Targeting Nominal GDP or Prices: Expectation Dynamics and the Interest Rate Lower Bound

Targeting Nominal GDP or Prices: Expectation Dynamics and the Interest Rate Lower Bound Targeting Nominal GDP or Prices: Expectation Dynamics and the Interest Rate Lower Bound Seppo Honkapohja, Bank of Finland Kaushik Mitra, University of Saint Andrews *Views expressed do not necessarily

More information

Task Routing for Prediction Tasks

Task Routing for Prediction Tasks Task Routing for Prediction Tasks The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Accessed Citable Link Terms of Use

More information

UIUC. Application of Game Theory to High Assurance Cloud Computing. 20 September 2016

UIUC. Application of Game Theory to High Assurance Cloud Computing. 20 September 2016 UIUC Application of Game Theory to High Assurance Cloud Computing 20 September 2016 Integrity Service Excellence Charles Kamhoua, Ph.D. Research Electronics Engineer Air Force Research Laboratory Cyber

More information

Complexity of the Gale String Problem for Equilibrium Computation in Games

Complexity of the Gale String Problem for Equilibrium Computation in Games Complexity of the Gale String Problem for Equilibrium Computation in Games Marta Maria Casetti Thesis submitted to the Department of Mathematics London School of Economics and Political Science for the

More information

6.896 Topics in Algorithmic Game Theory March 1, Lecture 8

6.896 Topics in Algorithmic Game Theory March 1, Lecture 8 6.896 Topics in Algorithmic Game Theory March 1, 2010 Lecture 8 Lecturer: Constantinos Daskalakis Scribe: Alan Deckelbaum, Anthony Kim NOTE: The content of these notes has not been formally reviewed by

More information

1. Lecture notes on bipartite matching

1. Lecture notes on bipartite matching Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in

More information

10703 Deep Reinforcement Learning and Control

10703 Deep Reinforcement Learning and Control 10703 Deep Reinforcement Learning and Control Russ Salakhutdinov Machine Learning Department rsalakhu@cs.cmu.edu Policy Gradient I Used Materials Disclaimer: Much of the material and slides for this lecture

More information

Lying and Deception in Games

Lying and Deception in Games Lying and Deception in Games Joel Sobel July 6, 2016 Abstract This article proposes definitions of lying and deception in strategic settings. A critical distinction is that deception requires a model of

More information

Applications of Repeated Games in Wireless Networks: A Survey

Applications of Repeated Games in Wireless Networks: A Survey 1 Applications of Repeated Games in Wireless Networks: A Survey Dinh Thai Hoang, Xiao Lu, Dusit Niyato, Ping Wang, and Zhu Han School of Computer Engineering, Nanyang Technological University, Singapore

More information

Resource sharing optimality in WiFi infrastructure networks

Resource sharing optimality in WiFi infrastructure networks Resource sharing optimality in WiFi infrastructure networks Ilenia Tinnirello 1, Laura Giarré 1, Giovanni Neglia 2 1 Università di Palermo, Italy, 2 INRIA, France (giarre@unipa.it) November 2009 MIT 1

More information

Simple Channel-Change Games for Spectrum- Agile Wireless Networks

Simple Channel-Change Games for Spectrum- Agile Wireless Networks 1 Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 26 Simple Channel-Change Games for Spectrum- Agile Wireless Networks Roli G. Wendorf and Howard Blum Abstract The proliferation

More information

Resource Allocation in Contention-Based WiFi Networks

Resource Allocation in Contention-Based WiFi Networks The 2011 Santa Barbara Control Workshop Resource Allocation in Contention-Based WiFi Networks Laura Giarré Universita di Palermo (giarre@unipa.it) Joint works with I. Tinnirello (Università di Palermo),

More information

Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games

Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games Jiří Čermák, Branislav Bošanský, Michal Pěchouček Department of Computer

More information

10708 Graphical Models: Homework 4

10708 Graphical Models: Homework 4 10708 Graphical Models: Homework 4 Due November 12th, beginning of class October 29, 2008 Instructions: There are six questions on this assignment. Each question has the name of one of the TAs beside it,

More information

ISM206 Lecture, April 26, 2005 Optimization of Nonlinear Objectives, with Non-Linear Constraints

ISM206 Lecture, April 26, 2005 Optimization of Nonlinear Objectives, with Non-Linear Constraints ISM206 Lecture, April 26, 2005 Optimization of Nonlinear Objectives, with Non-Linear Constraints Instructor: Kevin Ross Scribe: Pritam Roy May 0, 2005 Outline of topics for the lecture We will discuss

More information

1 Euler characteristics

1 Euler characteristics Tutorials: MA342: Tutorial Problems 2014-15 Tuesday, 1-2pm, Venue = AC214 Wednesday, 2-3pm, Venue = AC201 Tutor: Adib Makroon 1 Euler characteristics 1. Draw a graph on a sphere S 2 PROBLEMS in such a

More information

On the Efficiency of Negligence Rule

On the Efficiency of Negligence Rule Jawaharlal Nehru University From the SelectedWorks of Satish K. Jain 2009 On the Efficiency of Negligence Rule Satish K. Jain, Jawaharlal Nehru University Available at: https://works.bepress.com/satish_jain/2/

More information

Statistical Techniques in Robotics (16-831, F10) Lecture #02 (Thursday, August 28) Bayes Filtering

Statistical Techniques in Robotics (16-831, F10) Lecture #02 (Thursday, August 28) Bayes Filtering Statistical Techniques in Robotics (16-831, F10) Lecture #02 (Thursday, August 28) Bayes Filtering Lecturer: Drew Bagnell Scribes: Pranay Agrawal, Trevor Decker, and Humphrey Hu 1 1 A Brief Example Let

More information

Randomized Solutions to Partial Information Dynamic Zero-Sum Games

Randomized Solutions to Partial Information Dynamic Zero-Sum Games Randomized Solutions to Partial Information Dynamic Zero-Sum Games Shaunak D. Bopardikar João P. Hespanha Abstract This paper presents randomized methods to solve partial information dynamic zero-sum games.

More information

Games in Networks: the price of anarchy, stability and learning. Éva Tardos Cornell University

Games in Networks: the price of anarchy, stability and learning. Éva Tardos Cornell University Games in Networks: the price of anarchy, stability and learning Éva Tardos Cornell University Why care about Games? Users with a multitude of diverse economic interests sharing a Network (Internet) browsers

More information

Using HMM in Strategic Games

Using HMM in Strategic Games Using HMM in Strategic Games Mario Benevides Isaque Lima Rafael Nader Pedro Rougemont Systems and Computer Engineering Program and Computer Science Department Federal University of Rio de Janeiro, Brazil

More information

Agent-Based Systems. Agent-Based Systems. Michael Rovatsos. Lecture 13 Argumentation in Multiagent Systems 1 / 18

Agent-Based Systems. Agent-Based Systems. Michael Rovatsos. Lecture 13 Argumentation in Multiagent Systems 1 / 18 Agent-Based Systems Michael Rovatsos mrovatso@inf.ed.ac.uk Lecture 13 Argumentation in Multiagent Systems 1 / 18 Where are we? Last time... Bargaining Alternating offers Negotiation decision functions

More information

Two-player Games ZUI 2012/2013

Two-player Games ZUI 2012/2013 Two-player Games ZUI 2012/2013 Game-tree Search / Adversarial Search until now only the searching player acts in the environment there could be others: Nature stochastic environment (MDP, POMDP, ) other

More information

Section Marks Pre-Midterm / 32. Logic / 29. Total / 100

Section Marks Pre-Midterm / 32. Logic / 29. Total / 100 Name: CS 331 Final Exam Spring 2011 You have 110 minutes to complete this final exam. You are only allowed to use your textbook, your notes, your assignments and solutions to those assignments during this

More information

Rational Oblivious Transfer

Rational Oblivious Transfer Rational Oblivious Transfer Xiong Fan xfan@cs.umd.edu Kartik Nayak kartik1507@gmail.com May 14, 2014 Abstract Oblivious transfer is widely used in secure multiparty computation. In this paper, we propose

More information

Game Theoretic Solutions to Cyber Attack and Network Defense Problems

Game Theoretic Solutions to Cyber Attack and Network Defense Problems Game Theoretic Solutions to Cyber Attack and Network Defense Problems 12 th ICCRTS "Adapting C2 to the 21st Century Newport, Rhode Island, June 19-21, 2007 Automation, Inc Dan Shen, Genshe Chen Cruz &

More information

Abstraction Using Analysis of Subgames

Abstraction Using Analysis of Subgames Abstraction Using Analysis of Subgames Anjon Basak 1 and Christopher Kiekintveld 2 1 The University of Texas at El Paso abasak@miners.utep.edu, 2 The University of Texas at El Paso cdkiekintveld@utep.edu

More information

Network Improvement for Equilibrium Routing

Network Improvement for Equilibrium Routing Network Improvement for Equilibrium Routing UMANG BHASKAR University of Waterloo and KATRINA LIGETT California Institute of Technology Routing games are frequently used to model the behavior of traffic

More information

KNOWLEDGE TRANSFER AS A RATIONAL CHOICE: A DECISION THEORETIC CHARACTERIZATION

KNOWLEDGE TRANSFER AS A RATIONAL CHOICE: A DECISION THEORETIC CHARACTERIZATION NOWLEDGE TRANSFER AS A RATIONAL CHOICE: A DECISION THEORETIC CHARACTERIZATION Yasuo Sasaki School of nowledge Science, Japan Advanced Institute of Science and Technology 1-1, Asahidai, Nomi, Ishikawa,

More information