Awareness in Games, Awareness in Logic

Similar documents
Leandro Chaves Rêgo. Unawareness in Extensive Form Games. Joint work with: Joseph Halpern (Cornell) Statistics Department, UFPE, Brazil.

&$121,1' $VUHFRUGHGE\'DQLHO+R

Second Year March 2017

Extensive Games with Perfect Information. Start by restricting attention to games without simultaneous moves and without nature (no randomness).

1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col.

February 11, 2015 :1 +0 (1 ) = :2 + 1 (1 ) =3 1. is preferred to R iff

THE SHOPS AT ROSSMOOR NWC St Cloud Drive & Seal Beach Blvd, Seal Beach, CA

Data Flow 4.{1,2}, 3.2

Mohammad Hossein Manshaei 1394

GAME THEORY: STRATEGY AND EQUILIBRIUM

Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2)

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Logical Agents (AIMA - Chapter 7)

11/18/2015. Outline. Logical Agents. The Wumpus World. 1. Automating Hunt the Wumpus : A different kind of problem

UMBC CMSC 671 Midterm Exam 22 October 2012

A Modal Interpretation of Nash-Equilibria and Related Concepts. Paul Harrenstein, Wiebe van der Hoek, John-Jules Meyer

CHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to:

Extensive Form Games: Backward Induction and Imperfect Information Games

A Complete Approximation Theory for Weighted Transition Systems

EBDSM-PRM Product Guide

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

3 Game Theory II: Sequential-Move and Repeated Games

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi

1. Introduction to Game Theory

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

Game theory attempts to mathematically. capture behavior in strategic situations, or. games, in which an individual s success in

5.4 Imperfect, Real-Time Decisions

Advanced Signal Processing in Communications

Multi-Agent Negotiation: Logical Foundations and Computational Complexity

Band 10 Bandwidth and Noise Performance

NORMAL FORM GAMES: invariance and refinements DYNAMIC GAMES: extensive form

! 1F8B0 " 1F8B1 ARROW POINTING UPWARDS THEN NORTH WEST ARROW POINTING RIGHTWARDS THEN CURVING SOUTH WEST. 18 (M4b)

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Introduction to Game Theory

Distributed Broadcast Scheduling in Mobile Ad Hoc Networks with Unknown Topologies

arxiv: v1 [cs.gt] 12 Jun 2008

Games. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

arxiv:cs/ v1 [cs.gt] 7 Sep 2006

Vacuum Regulator IRV20 Series

Dynamic Games: Backward Induction and Subgame Perfection

Formal Verification. Lecture 5: Computation Tree Logic (CTL)

Extensive Form Games: Backward Induction and Imperfect Information Games

DVA325 Formal Languages, Automata and Models of Computation (FABER)

Stepper Motor Driver Type: STM xx1 Two-phase stepper motors with 4, 6 or 8 leads. Motor inductance must be greater than 0.5 mh.

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Multi-player, non-zero-sum games

Backward Induction. ISCI 330 Lecture 14. March 1, Backward Induction ISCI 330 Lecture 14, Slide 1

Logic and Artificial Intelligence Lecture 18

Agent Theories, Architectures, and Languages: A Survey

Low-Power Task Scheduling for Multiple Devices

Game Theory and Randomized Algorithms

Connectivity-based Localization in Robot Networks

Finite games: finite number of players, finite number of possible actions, finite number of moves. Canusegametreetodepicttheextensiveform.

Intelligent Agents. Introduction to Planning. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 23.

Algorithmic Game Theory and Applications. Kousha Etessami

Introduction to Game Theory I

Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness

Elements of Game Theory

EC3224 Autumn Lecture #02 Nash Equilibrium

Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016

Nonequilibrium Solution Concepts: Iterated Dominance and Rationalizability Ù

A Model-Theoretic Approach to the Verification of Situated Reasoning Systems

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Extensive-Form Correlated Equilibrium: Definition and Computational Complexity

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

Using Proof-of-Work to Coordinate

Simultaneous Move Games

1 Simultaneous move games of complete information 1

Introduction to Game Theory

Modal logic. Benzmüller/Rojas, 2014 Artificial Intelligence 2

Asynchronous Best-Reply Dynamics

KARO logic (Van Linder et al.) Epistemic logic. Dynamic Logic. Dynamic Logic KARO. Dynamic Logic. knowledge. belief. Interpretation formulas

Face Registration Using Wearable Active Vision Systems for Augmented Memory

IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING.

Extensive Form Games and Backward Induction

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

CS510 \ Lecture Ariel Stolerman

THEORY: NASH EQUILIBRIUM

Delivered at AERA in Chicago, April 1991

Figure 2. Another example from Teun Spaans Domino Plaza web site.

International Economics B 2. Basics in noncooperative game theory

Planar tautologies, hard for Resolution

Dynamic epistemic logic and lying

Game Theory two-person, zero-sum games

Microeconomics of Banking: Lecture 4

2. Extensive Form Games

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

Low Power Circuits for Multiple Match Resolution and Detection in Ternary CAMs

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

Superfat. Cape Arcona Type Foundry»Where fonts come true«

Cristina Bicchieri. Carnegie-Mellon University

Rationality and Common Knowledge

22c181: Formal Methods in Software Engineering. The University of Iowa Spring Propositional Logic

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides

Game Solution, Epistemic Dynamics and Fixed-Point Logics

CS 1571 Introduction to AI Lecture 12. Adversarial search. CS 1571 Intro to AI. Announcements

What is... Game Theory? By Megan Fava

Rational decisions in non-probabilistic setting

4. Give a verbal description of the elements in region " (R") in the diagram. a) not in A c) in Aand in B

Transcription:

Awareness in Games, Awareness in Logic Joseph Halpern Leandro Rêgo Cornell University Awareness in Games, Awareness in Logic p 1/37

Game Theory Standard game theory models assume that the structure of the game is common knowledge among the players This includes the possible moves and the set of players Problem: Not always a reasonable assumption; for example: war settings one side may not be aware of weapons the other side has financial markets an investor may not be aware of new innovations auctions in large networks, you may not be aware of who the bidders are Awareness in Games, Awareness in Logic p 2/37

This talk: Discuss how awareness can be added in games Halpern and Rego: Extensive games with possibly unaware players Lots of other work in the game theory community Discuss how awareness can be added to epistemic logic Halpern and Rego: Reasoning About Knowledge of Unawareness Revisited Work goes back to Fagin and Halpern (1985) Now lots of work in the game theory community! Awareness in Games, Awareness in Logic p 3/37

Nash Equilibrium Arguably, the major goal is to define appropriate solution concepts how a game is/should be played The standard solution concept in game theory is Nash equilibrium (NE) No player can gain by unilaterally changing his strategy But Nash equilibrium does not always make sense if players are not aware of all moves Awareness in Games, Awareness in Logic p 4/37

A Simple Game One Nash equilibrium of this game plays across, plays down (not unique) But if is not aware that can play down, will play down Awareness in Games, Awareness in Logic p 5/37

We need a solution concept that takes awareness into account! First step: represent games where players may be unaware Awareness in Games, Awareness in Logic p 6/37

Representing lack of awareness : an underlying standard extensive game describes the moves actually available to players An augmented game based on that also determines for each history is essentially a standard game an awareness level, the set of runs in the underlying game that the player who moves at is aware of Intuition: an augmented game describes the game from the point of view of an omniscient modeler or one of the players Awareness in Games, Awareness in Logic p 7/37

Augmented Games Consider the earlier game Suppose that players and are aware of all histories of the game; player across probability is uncertain as to whether player, down ; and the type of player aware that player uncertain about and believes that that is aware of the run is aware of run is unaware of it with across, down is is aware of all histories, and he knows is s awareness level and knows the probability To represent this, we need three augmented games Awareness in Games, Awareness in Logic p 8/37

Modeler s Game Both and are aware of all histories of the underlying game But considers it possible that is unaware To represent s viewpoint, we need another augmented game Awareness in Games, Awareness in Logic p 9/37

s View of the Game At node, is not aware of the run across, down We need yet another augmented game to represent this Awareness in Games, Awareness in Logic p 10/37

! ( s view of) s view At node, is not aware of across, down ; neither is at! Moral: to fully represent a game with awareness we need a set of augmented games Like a set of possible worlds in Kripke structures Awareness in Games, Awareness in Logic p 11/37

, + * " " " ( ' " ",2 1 " & 0 / " & + ( ( ( " / 0 1 2 " 0 2 0 1 " #" Game with Awareness A game with awareness based on is a tuple #%$ &')(, where is a countable set of augmented games based on ; ' * - is an omniscient modeler s view of the game If, $ then in history of game, player believes that the actual game is and he is in information set ( s information set) describes the histories where might be in thinks There are some consistency conditions that must satisfy See paper Awareness in Games, Awareness in Logic p 12/37

Example Continued Awareness in Games, Awareness in Logic p 13/37

3 3 7 4 6 5 6 3 Adding Awareness to Games There are many games of awareness based on an underlying game, that vary depending on how players awareness levels change over time; players beliefs about other players awareness level Example: If in the simple game players were indeed unaware of run, we have considered so far, both across, down, and this was common knowledge, then in the modeler s game of this example, players awareness level would not include this run, and we would only need game to model players view of the game Awareness in Games, Awareness in Logic p 14/37

8 D 8 9 8 9? ; 8 : 9 <@ K M ; M 9 L LJ 8 G 8 8 8 Canonical Representation A standard extensive game ; B @? ; = 8 <>=, where JE I :FHG 8 = can be identified with the game, where A@CB ;)= and for @ D ;)= A E A E, and 9 A@B F G This is the canonical representation of awareness as a game with Intuition: In the canonical representation of as a game with awareness, all players understand the structure of the underlying game is common knowledge among players and this A standard game can be viewed as a special case of a game with awareness, where the underlying game is common knowledge Awareness in Games, Awareness in Logic p 15/37

N N N N N Strategies In a standard game, a behavioral strategy for player from -information sets to a distribution over moves is a function must do the same thing at histories cannot tell apart A strategy is a universal plan, describing what possible circumstance will do in every In games with awareness, this does not make sense! A player cannot plan in advance what he will do when he becomes aware of new moves Awareness in Games, Awareness in Logic p 16/37

WV U O O T ] O ^ ^ ^ ] O ] O Local Strategies In a game P%Q RS)T with awareness, we consider a collection of local strategies, one for each augmented game an agent may consider to be the true one in some situation Intuitively, a local strategy would use if true game was \[ XYCZ for game were called upon to play and is the strategy that thought that the There may be no relationship between the strategies different games for \[ XYCZ Awareness in Games, Awareness in Logic p 17/37

b dc b dc c c Generalized Nash Equilibrium Intuition: is a generalized Nash equilibrium if for every player _a` believes he is playing game, then his local strategy best response to the local strategies of other players in is a hg `ecf, if The local strategies of the other players are part of _ ` is a Nash equilibrium of a standard game _ ` iff is a _a` (generalized) Nash equilibrium of the canonical representation of as a game with awareness Theorem: Every game with awareness has at least one generalized Nash equilibrium Awareness in Games, Awareness in Logic p 18/37

i Awareness of Unawareness Sometimes players may be aware that they are unaware of relevant moves: War settings: you know that an enemy may have new technologies of which you are not aware Delaying a decision you may become aware of new issues tomorrow Chess lack of awareness inability to compute Awareness in Games, Awareness in Logic p 19/37

l j k j j l k j Modeling Awareness of Unawareness If then is aware that can make a move at can make a virtual move at in representation of the game The payoffs after a virtual move reflect outcome after the move that s subjective is not aware of, s beliefs about the Just like associating a value to a board position in chess Again, there is guaranteed to be a generalized Nash equilibrium Awareness in Games, Awareness in Logic p 20/37

p p p } x y} m o y m o q q Reasoning About Games Game theorists reason about games using knowledge Do you know/believe your opponent(s) are rational? They essentially model knowledge using Kripke structures of the form opq mcn y x rwvq rts qu uu q is a set of worlds (states) In game theory: the players, the game being played describes, eg, the strategies used by is a binary relation on r{z y } ~ oa q if, in world rtz :, agent considers possible gives meaning to primitive propositions n if z n for all y } ~ o q r z Awareness in Games, Awareness in Logic p 21/37

Adding Awareness: A Biased History [Hintikka, 1962]: The standard semantics for epistemic logic suffers from the logical omniscience problem: agents know all tautologies and know all the logical consequences of their knowledge One approach for dealing with logical omniscience: model agent s lack of awareness [Fagin and Halpern, 1985/88] (FH from now on) This allows us to model, eg, agents who are not aware of all moves in a game Awareness in Games, Awareness in Logic p 22/37

Š Capturing Awareness FH model awareness using a syntactic awareness operator Awareness described explicitly by listing the formulas an agent is aware of at each state Add operators and ƒh for each agent to the language : agent ƒ is aware of : agent explicitly knows aš ˆ : the formulas that agent is aware of at state Ž Š Œ is true if if ƒh implicitly knows aš ˆ considers possible) and is aware of it ƒh (it s true at all worlds the agent Awareness in Games, Awareness in Logic p 23/37

ž ž Ÿ The MR-HMS approach Modica and Rustichini [1994,1999] (MR) took a different approach: A possibly different set with each world a of primitive propositions is associated œ š only if every primitive proposition in is in a is defined as usual (truth in all possible worlds) is an abbreviation for Ÿa holds iff ž ž{ Heifetz, Meier, and Schipper [2003, 2008] (HMS) extend the MR approach to multiple agents The extension is nontrivial: requires lattices of state spaces, with projection functions between them Awareness in Games, Awareness in Logic p 24/37

Constraints on FH Awareness Can impose constraints on : awareness is generated by primitive propositions (agpp) if an agent is aware of iff «aª iff he is aware of all of the primitive in : «aª ± primitive propositions in Agents know what they are aware of (ka): if then «³ aªa² «³ ± «aª Halpern [2001] and Halpern and Rêgo [2007] show that MR-HMS models are special cases of the FH awareness model where awareness is generated by primitive propositions and agents know what they are aware of Awareness in Games, Awareness in Logic p 25/37

µ ¾ ¾ Ä Capturing Knowledge of Unawareness If awareness is generated by primitive propositions (as in the MR-HMS approach), then an agent cannot know that he is unaware of a fact So how do we model knowledge and awareness of unawareness? In [Halpern and Rêgo, 2006/09] (HR), we model knowledge of unawareness by allowing quantification over formulas Can say agent knows a formula of which he is unaware Formally, allow formulas of the form, º¹ µ ¹ µ The quantification is over quantifier-free formulas»¼½ formulas iff»¼½ º¹ µ À Á ÅÄà  ¹µ À Á for all quantifier-free Restriction is necessary to make semantics well defined Awareness in Games, Awareness in Logic p 26/37

Ð Ð Ñ The Good News We can capture knowledge of lack of awareness: Ï ÆHÎ É Í Ì ÉÇ Ê{Ë ÈºÉ ÆHÇ knows to be true that he ( : knows that there is some formula that ) is not aware of There is an elegant complete axiomatization Awareness in Games, Awareness in Logic p 27/37

Ô Ü Ò and the Bad News (Under standard assumptions) it is impossible for an agent to be uncertain about whether he is aware of all formulas Consider ÒCÓ Ù ØaÛ Ö Ø ÕHÖ Ô Ú Ù ØÖ ºØ Ô ÕHÖ agent considers it possible that she is aware of all formulas and also considers it possible that she is not aware of all formulas is unsatisfiable! Follows from assumption that in all worlds you consider possible you are aware of the same primitive propositions + KD45 axioms Awareness in Games, Awareness in Logic p 28/37

ß ç Ý and the Bad News (Under standard assumptions) it is impossible for an agent to be uncertain about whether he is aware of all formulas Consider ÝCÞ ä ãaæ á â ã àhá ß å ä ãá âºã ß àhá agent considers it possible that she is aware of all formulas and also considers it possible that she is not aware of all formulas is unsatisfiable! Follows from assumption that in all worlds you consider possible you are aware of the same primitive propositions + KD45 axioms + assumption that the language is the same at all worlds! Awareness in Games, Awareness in Logic p 28/37

è A Better Approach We combine a number of ideas: from FH: the basic framework (syntactic awareness) from HR: quantification to express knowledge of lack of awareness from MR/HMS: idea of allowing a different language at each state We get an elegant complete axiomatization (a variant of the HR axioms) Extends the HMS axioms to allow knowledge of unawareness a model that satisfies don t need a syntactic awareness function in the model:,, and ñ ë îðï ë ì í ê ë éhê ì ïê î ë ì ê ë ì ê are equivalent Awareness in Games, Awareness in Logic p 29/37

ÿ þ ý ÿ ÿ ü ÿ Syntax and Semantics Syntax: The syntax is identical to that of HR: start with a set of primitive propositions, close off under, and quantification ( ö ó, ) ù ø ºø,, õ ó òôó Semantics: Extend FH awareness structures to allow a different language at each state An extended awareness structure is a tuple þ þ þ þ þ þ üýþ úcû is a set of states ü is a set of primitive propositions the language at state ü ó the set of formulas is aware of at At, can be aware only of formulas ü formulas all of whose primitive propositions are in ü Awareness in Games, Awareness in Logic p 30/37

! ) 3 " The Truth Relation We give semantics to formulas just as in HR, except that for a formula Eg:, we must have to be true at a world and if # and " if for all *)( ' % and $&% if quantifier-free sentences for all and +-, if /, where is satisfiable in a state 1 %, $ % 0, " 2 1 %, $&% " 0, and another world 8, 7 465 where 465 considers possible a world 8, : 4 9 where 469 Awareness in Games, Awareness in Logic p 31/37

< ; <? CA C > ;? Axiomatization A formula is valid in a class for all extended awareness structures A @AB, ; EF C? =D In the full paper, we give an axiom system of extended awareness structures if, = > and complete with respect to structures where relation and both agpp and ka hold IKJ GH and worlds M J L J O MN J such that P that is sound is an equivalence QSR These are the standard assumptions in the literature Sound: all provable formulas are valid Complete: all valid formulas are provable Need the notion of validity above Awareness in Games, Awareness in Logic p 32/37

[ \ a m a m Axiomatizing TVU Using WX U The standard axioms for do not quite hold Y-Z \ Y-Z [ Y-Z ] \ Y-Z is not sound Eg: if c ab ` ^ _, will have \ Y Z [ Y Z [ h \ Y Z [ fg c b ade Let \ ij Z be an abbreviation for c \ [ k \ a YZ Proposition: If is Euclidean, then l Z \ Y Z [ Y-Z ] c \ Y Z [ h \ ji Z is valid Well known: If is Euclidean and ka holds, then l Z \ n Z [ n Z ] c \ n Z [ h \ i Z is valid Get analogous axioms for and Y-Z, with n Z ij Z playing role of i Z Awareness in Games, Awareness in Logic p 33/37

po ˆ, o, and oq Recall that v rsut is an abbreviation for v y{z v x wt Let v r} t be an abbreviation for w zt y v w t v w t Theorem: Recall that this is how MR and HMS define awareness (a) v rsut ~ v r} t is valid (b) If is Euclidean, then St v r} t ~ v rsut is valid (c) If agents know what they are aware of, then v rsut ~ v r t is valid (d) v r-t ~ v rs t is (trivially) valid under the following assumption: If, then x t ƒ xˆ ƒ for some such that St ˆ x Under minimal assumptions,,, and r} t r-t rsut are equivalent Awareness in Games, Awareness in Logic p 34/37

Language and Awareness If Ž Š Œ, Š Ž Ž Š may be nonempty may consider possible formulas of which he is unaware can label formulas that he does not understand This is a feature: we want to allow agents to have some partial information about formulas that they are unaware of Eg, want ŠS Š &š - Ž Š œ š Ž ŽŽ Š ž-ÿ š to be consistent An agent may have enough partial information about a formula he is unaware of that he can describe it sufficiently well to communicate about it When this happens in natural language, people will come up with a name for a concept and add it to their language Awareness in Games, Awareness in Logic p 35/37

Summary We have a flexible framework for reasoning about (lack of) awareness of moves in games an arguably reasonable extension of Nash equilibrium that takes (lack of) awareness into account a logic for reasoning about knowledge and (lack of) awareness an elegant complete axiomatization for the logic connections to other approaches importance of language Awareness in Games, Awareness in Logic p 36/37

(Some) Open Problems Game Theory: What is the right solution concept in games of awareness? Where do your beliefs come from when you become aware of something new Ozbay (2007): that should be part of the solution concept Connect to work defining solution concepts that take computation into account (joint with Rafael Pass) Logic: adding probability dynamics of language change Awareness in Games, Awareness in Logic p 37/37