Today s lecture. Competitive Matrix Games. Competitive Matrix Games. Modeling games as hybrid systems. EECE 571M/491M, Spring 2007 Lecture 17
|
|
- Eileen Peters
- 5 years ago
- Views:
Transcription
1 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 moishi@ece.ubc.ca Meeko Oishi, Ph.D. Electrical and Computer Engineering University of British Columbia, BC Hwang, Balakrishnan, and omlin 006) Social dynamics in animal groups wo-player groups hree-player groups Optimal switching policies EECE 57M / 49M Winter 007 Strategies p: frequency Player chooses A q: frequency Player chooses A mixed strategies allowed for both players) Player : Player : u,v ) u,v u,v ) u,v Sum of all strategies for each player must sum to. Players can have more than two strategies Payoffs For a given combination of strategies: Player plays a mixed strategy, p percent A, -p) percent B Player plays a mixed strategy, q percent A, -q) percent B Player receives payoff V p,q) Player receives payoff V p,q) p & u V u & % p) % u u % q) p & v V v & % p) % v v % q) Player : Player : u,v ) u,v u,v ) u,v EECE 57M / 49M Winter 007 EECE 57M / 49M Winter 007 4
2 Nash Competitive Equilibria NCE) u ij ) such that u i j ) u ij ) Points where neither player, considered independently, could do better than the current strategy. NO unique: More than one NCE may exist in a matrix game NCE are Pareto-optimal EECE 57M / 49M Winter 007 and u ij ) u ij ) u ij ) such that there is no u ij, v ij ) u ij ) Player : Player : u,v ) u,v u,v ) u,v 5 Disagreement hreat) Points P) d d % max & p max q Best worst-case benefit each player could receive. Strategy to find d may be different than strategy to find d Without any information about other player s strategy, this is the best one player can accomplish. EECE 57M / 49M Winter 007 min q min p p Uq% p Vq & Player : with abuse of notation, p [p; -p], q [q; -q] here) Player : u,v ) u,v u,v ) u,v 6 wo-player Matrix Games Cooperative Matrix Games Consider the game with EECE 57M / 49M Winter 007 Player : Player :,7) 7, 0,),0) & 7 Strategies x AA : frequency Player and Player jointly choose AA x AB : frequency Player and Player jointly choose AB x BA : frequency Player and Player jointly choose BA x BB : frequency Player and Player jointly choose BB Strategies must sum to A larger region in the value space is now accessible with these strategies than under competitive play Cooperation possible when both players are above their respective threat points Guaranteed to do the same or better than under competition Player : Player : A u,v ) u,v B u,v ) u,v EECE 57M / 49M Winter 007 8
3 Cooperative Matrix Games Payoffs For a given strategy x[x AA, x AB, x BA, x BB ] V x) [ u u u u ]x V x) [ v v v v ]x Player receives payoff V x) Player receives payoff V x) Cooperative Matrix Games Nash Bargaining Solution NBS) V NBS max V x) d x ) V x) d ) Point for which both players can optimize their joint benefit NBS solution can be less than what one player might receive from an NCE solution Implied notion -- repeated interactions for which threats are credible and all information known EECE 57M / 49M Winter 007 Player : Player : u,v ) u,v u,v ) u,v 9 EECE 57M / 49M Winter 007 Player : Player : u,v ) u,v u,v ) u,v 0 Motivation for Hybrid Systems Competitive Dynamic Games Strategies are continuous variables, evolving dynamically In some settings e.g., animal groups) games are occurring continuously Players update their strategies according to their current benefit Players move in directions of increased benefit Dynamics differ when players are competing or cooperating Based on dynamics for gamete allocation EECE 57M / 49M Winter 007 Dynamic strategies As before, p, q are percentage of time spent playing strategy A Dependent on individual benefit gradients Payoffs As defined previously p & u V u & % p) % u u % q) p & v V v & % p) % v v % q) EECE 57M / 49M Winter 007 Player : p p) V p p,q) V p,q) p q q) V q p,q) V p,q) q Player : u,v ) u,v u,v ) u,v
4 Cooperative Dynamic Games Dynamic strategies As before, x[xaa, xab, xba, xbb] is percentage of time spent playing strategies AA, AB, BA, BB, respectively Dependent on joint benefit gradient x ij Dynamic Games x ij x ij ) Vx) d)v x) d ) V x) d )V x) d )) x Payoffs V x) [ u u u u ] x V x) [v v v v ] x Player : A B Stability in the sense of Lyapunov Competitive dynamics converge locally to the NCE Cooperative dynamics converge to the NBS for any x which result in V,V) above the threat point Differential algebraic equations due to fact that strategies must sum to. Polynomial dynamics, polynomial output payoff) Player : A B u,v ) u,v ) % u,v ) u,v )& EECE 57M / 49M Winter 007 EECE 57M / 49M Winter wo-player hybrid game Social dynamics in animals Cooperation Competition Competition Darwin, 86, Sexual selection theory Cooperation occurs when both players benefits are above their threat point J. Nash, 950, NCE Maynard Smith, 98. Evolutionary stable strategies Competition occurs when either player s benefit is below their threat point 5 Bluegill Sunfish Optimization of individual fitness J. Nash, 95, NBS Roughgarden, 006, Social selection theory EECE 57M / 49M Winter 007 Peacock-Wrasse Cooperation d hreat Point Competition for genes Well-documented variations in nature Oystercatcher Optimization of joint fitness EECE 57M / 49M Winter 007 Pukeko 6
5 Peacock-wrasse Bluegill Sunfish Female : Evidence for cooperative nesting Sea Floor Nest strategies Search,) 0,0 Male : Stay 0,0),)& Why does the nesting male sometimes allow the satellite male to fertilize eggs in the Defend nest? Male : Allow EECE 57M / 49M Winter hree-player hybrid games Each player s strategy evolves continuously opology indicates alliances, which are mutual Different dynamics depending on level of competition or cooperation Rational dynamics Minimum set of conditions for mode to be feasible e.g., based on threat points) Competition between all three players Each player has strategies vs {} 8 hree-player hybrid games EECE 57M / 49M Winter 007 vs vs EECE 57M / 49M Winter 007 Male : Avoid Intrude,0) 0,) %,0) 0.5,0.5 vs {} vs {} Cooperation between all three players otal of 8 strategies {} 9 EECE 57M / 49M Winter 007 0
6 hree-player hybrid games hree-player hybrid games,{} x f a x) y V a x),, x f 0 x) y V 0 x),{} x f b x) y V b x) {} x f d x) y V d x),{} x f c x) y V c x) )) Competition,,): x ijk x x ) V x) d ijk ijk m m m Cooperation {}): V mx) d m ) x ijk p p) V m p p,q,r) V p,q,r) p q q) V x Coalition,{}): x ij ij x ij ) V x,r)v x,r)) q p,q,r) V V x,r)v x,r) x ij p,q,r) q r r) V r r) V r x,r) r p,q,r) V EECE V p,q,r) 57M / 49M r Winter 007 x,r) r Divide the Dollar,{} EECE 57M / 49M Winter 007 Oystercatchers Monogamous pairs, polygynous trios rios: 50% shared nests, 50% separate nests How can hybrid dynamical games explain this phenomena? Male : A Female : Aggress Bond Female : Aggress,,),0,) % Bond,,),,4 Male : B F : F: A,,),,) % B 0,,),,4 Switching coalitions Optimal switching policies Dynamic programming with multiple objectives and state discontinuities Pursuer/evader aircraft games Comparison to standard game theory results bargaining sets, core, etc.) Analysis of hybrid switching Predicting switching coalitions periodic orbits) EECE 57M / 49M Winter 007 EECE 57M / 49M Winter 007 4
7 Oystercatchers Summary Coalition dynamics {} Matrix games competitive and cooperative) Hybrid dynamical games: social dynamics in animal groups Modeling Stability within each coalition through Lyapunov functions Relationship to traditional discrete) models,,,{} Predicting ecological phenomenon Oystercatcher trios polygynous), 50% aggressive, 50% cooperative Bluegill sunfish mating strategies Peacock-Wrasse mating strategies Optimal coalition formation and dissolution EECE 57M / 49M Winter EECE 57M / 49M Winter 007 6
Game Theory & Networks
Game Theory & Networks (an incredibly brief overview) ndrew Smith ECS 253/ME 289 May 10th, 2016 Game theory can help us answer important questions for scenarios where: players/agents (nodes) are autonomous
More informationNash equilibria in Voronoi Games on Graphs
Nash equilibria in Voronoi Games on Graphs Christoph Dürr, Nguyễn Kim Thắng (Ecole Polytechnique) ESA, Eilat October 07 Plan Motivation : Study the interaction between selfish agents on Internet k players,
More informationPiecewise Quadratic Optimal Control
EECE 571M/491M, Spring 2007 Lecture 15 Piecewise Quadratic Optimal Control Meeko Oishi, Ph.D. Electrical and Computer Engineering University of British Columbia, BC http://www.ece.ubc.ca/~elec571m.html
More informationBargaining 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 informationMIDTERM 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 informationCoordination and Control in Multi-Agent Systems
Coordination and Control in Multi-Agent Systems Prof. dr. Ming Cao Institute of Engineering and Technology University of Groningen The Netherlands Outline What are agents and multi-agent systems? Mobile
More informationCourse Summary Homework
Course Summary Homework (Max useful score: 100 - Available points: 210) 15-382: Collective Intelligence (Spring 2018) OUT: April 21, 2018, at 1:00am DUE: May 1, 2018 at 1pm - Available late days: 0 Instructions
More informationHow Bad is Selfish Routing?
How Bad is Selfish Routing? Tim Roughgarden and Éva Tardos Presented by Brighten Godfrey 1 Game Theory Two or more players For each player, a set of strategies For each combination of played strategies,
More informationPascal De Beck-Courcelle. Master in Applied Science. Electrical and Computer Engineering
Study of Multiple Multiagent Reinforcement Learning Algorithms in Grid Games by Pascal De Beck-Courcelle A thesis submitted to the Faculty of Graduate and Postdoctoral Affairs in partial fulfillment of
More informationEE228a - Lecture 20 - Spring 2006 Concave Games, Learning in Games, Cooperative Games
EE228a - Lecture 20 - Spring 2006 Concave Games, Learning in Games, Cooperative Games Jean Walrand - scribed by Michael Krishnan (mnk@berkeley.edu) Abstract In this lecture we extend our basic game theory
More informationA New Approach to Meusnier s Theorem in Game Theory
Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3163-3170 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.712352 A New Approach to Meusnier s Theorem in Game Theory Senay Baydas Yuzuncu
More informationReach Sets and the Hamilton-Jacobi Equation
Reach Sets and the Hamilton-Jacobi Equation Ian Mitchell Department of Computer Science The University of British Columbia Joint work with Alex Bayen, Meeko Oishi & Claire Tomlin (Stanford) research supported
More informationAlgorithmic 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 informationNetwork games. Brighten Godfrey CS 538 September slides by Brighten Godfrey unless otherwise noted
Network games Brighten Godfrey CS 538 September 27 2011 slides 2010-2011 by Brighten Godfrey unless otherwise noted Demo Game theory basics Games & networks: a natural fit Game theory Studies strategic
More informationOver-contribution in discretionary databases
Over-contribution in discretionary databases Mike Klaas klaas@cs.ubc.ca Faculty of Computer Science University of British Columbia Outline Over-contribution in discretionary databases p.1/1 Outline Social
More informationOn a Network Generalization of the Minmax Theorem
On a Network Generalization of the Minmax Theorem Constantinos Daskalakis Christos H. Papadimitriou {costis, christos}@cs.berkeley.edu February 10, 2009 Abstract We consider graphical games in which edges
More informationReach Sets and the Hamilton-Jacobi Equation
Reach Sets and the Hamilton-Jacobi Equation Ian Mitchell Department of Computer Science The University of British Columbia Joint work with Alex Bayen, Meeko Oishi & Claire Tomlin (Stanford) research supported
More informationPackage EvolutionaryGames
Type Package Package EvolutionaryGames November 27, 2017 Title Important Concepts of Evolutionary Game Theory Version 0.1.0 Maintainer Jochen Staudacher A comprehensive
More informationA Game-Theoretic Framework for Congestion Control in General Topology Networks
A Game-Theoretic Framework for Congestion Control in General Topology SYS793 Presentation! By:! Computer Science Department! University of Virginia 1 Outline 2 1 Problem and Motivation! Congestion Control
More informationStrategic 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 informationTopics in Artificial Intelligence: Multiagent Systems Selfish Routing in Computer Networks
Topics in Artificial Intelligence: Multiagent Systems Selfish Routing in Computer Networks Sebastian Streg December 10, 2005 1 Introduction Efficiency in networks with lots of traffic is a serious problem
More informationCAP 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 informationThe 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 informationCHAPTER 13: FORMING COALITIONS. Multiagent Systems. mjw/pubs/imas/
CHAPTER 13: FORMING COALITIONS Multiagent Systems http://www.csc.liv.ac.uk/ mjw/pubs/imas/ Coalitional Games Coalitional games model scenarios where agents can benefit by cooperating. Issues in coalitional
More informationIntroduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/3/15
600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/3/15 25.1 Introduction Today we re going to spend some time discussing game
More informationModeling and Simulating Social Systems with MATLAB
Modeling and Simulating Social Systems with MATLAB Lecture 7 Game Theory / Agent-Based Modeling Stefano Balietti, Olivia Woolley, Lloyd Sanders, Dirk Helbing Computational Social Science ETH Zürich 02-11-2015
More informationMultiple 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 informationAlgorithmic 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 informationA 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 information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationCooperative Games. Lecture 1: Introduction. Stéphane Airiau. ILLC - University of Amsterdam
Cooperative Games Lecture 1: Introduction Stéphane Airiau ILLC - University of Amsterdam Stéphane Airiau (ILLC) - Cooperative Games Lecture 1: Introduction 1 Why study coalitional games? Cooperative games
More informationISM206 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 informationA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
Iranian Journal of Fuzzy Systems Vol. 5, No. 7, 208 pp. 2-3 2 A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS A. C. CEVIKEL AND M. AHLATCIOGLU Abstract. In this paper,
More informationIntroduction to Game Theory
Lecture Introduction to Game Theory March 30, 005 Lecturer: Anna R. Karlin Notes: Atri Rudra In this course we will look at problems and issues which fall in the intersection of Computer Science and Economics.
More informationGames 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 informationMAY 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 informationdoi: /j.ipl
doi: 101016/jipl201110015 A comment on pure-strategy Nash equilibria in competitive diffusion games Reiko Takehara a, Masahiro Hachimori a, Maiko Shigeno a,1, a Graduate School of Systems and Information
More informationThe Price of Selfishness in Network Coding
The Price of Selfishness in Network Coding Jason R. Marden and Michelle Effros Abstract We introduce a game theoretic framework for studying a restricted form of network coding in a general wireless network.
More informationIntroduction to algorithmic mechanism design
Introduction to algorithmic mechanism design Elias Koutsoupias Department of Computer Science University of Oxford EWSCS 2014 March 5-7, 2014 Part I Game Theory and Computer Science Why Game Theory and
More informationKey question: how to set CongestionWindow which, in turn, affects ARQ s sending rate? linear increase/exponential decrease AIMD
TCP congestion control Recall: EffectiveWindow = MaxWindow (LastByteSent LastByteAcked) where MaxWindow = min{ AdvertisedWindow, CongestionWindow } Key question: how to set CongestionWindow which, in turn,
More informationStrategic Characterization of the Index of an Equilibrium. Arndt von Schemde. Bernhard von Stengel
Strategic Characterization of the Index of an Equilibrium Arndt von Schemde Bernhard von Stengel Department of Mathematics London School of Economics Battle of the sexes he she football football opera
More informationHedonic Clustering Games
Hedonic Clustering Games [Extended Abstract] Moran Feldman CS Dept., Technion Haifa, Israel moranfe@cs.technion.ac.il Liane Lewin-Eytan IBM Haifa Research Lab. Haifa, Israel lianel@il.ibm.com Joseph (Seffi)
More informationLecture 12 November 28, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 12 November 28, 2018 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2018-2019 Application of Game Theory to Network Selection Outline Network
More informationData-Aware Game Theory and Mechanism Design for Security, Sustainability and Mobility. Fei Fang Wean Hall 4126
Data-Aware Game Theory and Mechanism Design for Security, Sustainability and Mobility Fei Fang feifang@cmu.edu Wean Hall 4126 Societal Challenges: Security and Sustainability 2 Societal Challenges: Security
More informationDifferent Optimal Solutions in Shared Path Graphs
Different Optimal Solutions in Shared Path Graphs Kira Goldner Oberlin College Oberlin, OH 44074 (610) 324-3931 ksgoldner@gmail.com ABSTRACT We examine an expansion upon the basic shortest path in graphs
More informationStochastic 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 informationCDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH. Unit : I - V
CDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH Unit : I - V UNIT I Introduction Operations Research Meaning and definition. Origin and History Characteristics and Scope Techniques in Operations
More informationNash Equilibrium Load Balancing
Nash Equilibrium Load Balancing Computer Science Department Collaborators: A. Kothari, C. Toth, Y. Zhou Load Balancing A set of m servers or machines. A set of n clients or jobs. Each job can be run only
More informationAlgorithmic 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 informationApproximation-stability and proxy objectives
Harnessing implicit assumptions in problem formulations: Approximation-stability and proxy objectives Avrim Blum Carnegie Mellon University Based on work joint with Pranjal Awasthi, Nina Balcan, Anupam
More informationVoI for adversarial information structures
ARO ARO MURI MURI on on Value-centered Theory for for Adaptive Learning, Inference, Tracking, and and Exploitation VoI for adversarial information structures Kickf Emre Ertin, Nithin Sugavanam The Ohio
More informationOutline. CS 6776 Evolutionary Computation. Numerical Optimization. Fitness Function. ,x 2. ) = x 2 1. , x , 5.0 x 1.
Outline CS 6776 Evolutionary Computation January 21, 2014 Problem modeling includes representation design and Fitness Function definition. Fitness function: Unconstrained optimization/modeling Constrained
More informationLecture 2. Sequential Equilibrium
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
More informationHow do networks form? Strategic network formation
How do networks form? Strategic network formation Mihaela van der Schaar University of California, Los Angeles Acknowledgement: ONR 1 Social networks Friendship networks Work networks Scientific networks
More informationD-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview
Chapter 888 Introduction This procedure generates D-optimal designs for multi-factor experiments with both quantitative and qualitative factors. The factors can have a mixed number of levels. For example,
More informationThe Price of Selfishness in Network Coding Jason R. Marden, Member, IEEE, and Michelle Effros, Fellow, IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012 2349 The Price of Selfishness in Network Coding Jason R. Marden, Member, IEEE, and Michelle Effros, Fellow, IEEE Abstract A game-theoretic
More informationThe Classical Clustering Problem. = an edge-weighted graph G
IWCSN 13, Vancouver, BC, December 12, 2013 The Classical Clustering Problem = an edge-weighted graph G In most cases, communities are algorithmically defined, i.e. they are just the final product of the
More informationOptimal and Game-Theoretic Deployment of Security Investments in Interdependent Assets
Optimal and Game-Theoretic Deployment of Security Investments in Interdependent Assets Ashish R. Hota, Abraham A. Clements, Shreyas Sundaram and Saurabh Bagchi School of Electrical and Computer Engineering
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec Stanford University Jure Leskovec, Stanford University http://cs224w.stanford.edu [Morris 2000] Based on 2 player coordination game 2 players
More informationCS154, Lecture 18: 1
CS154, Lecture 18: 1 CS 154 Final Exam Wednesday December 13, 12:15-3:15 pm Skilling Auditorium You re allowed one double-sided sheet of notes Exam is comprehensive (but will emphasize post-midterm topics)
More informationAdversarial Signal Processing and the Hypothesis Testing Game
HKBU May 23, 2017 Distinguished Lecture Series Adversarial Signal Processing and the Hypothesis Testing Game Mauro Barni University of Sienna, Italy Outline of the talk Motivation Adversarial signal processing
More informationNash Equilibrium Strategies in Fuzzy Games
Chapter 5 Nash Equilibrium Strategies in Fuzzy Games Alireza Chakeri, Nasser Sadati and Guy A. Dumont Additional information is available at the end of the chapter http://dx.doi.org/0.5772/54677. Introduction
More informationUsing 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 informationCOMPRESSED SENSING: A NOVEL POLYNOMIAL COMPLEXITY SOLUTION TO NASH EQUILIBRIA IN DYNAMICAL GAMES. Jing Huang, Liming Wang and Dan Schonfeld
COMPRESSED SENSING: A NOVEL POLYNOMIAL COMPLEXITY SOLUTION TO NASH EQUILIBRIA IN DYNAMICAL GAMES Jing Huang, Liming Wang and Dan Schonfeld Department of Electrical and Computer Engineering, University
More informationComment 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 informationSufficiently 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 informationLesson 5: Graphs of Functions and Equations
Classwork Exploratory Challenge/Exercises 1 3 1. The distance that Giselle can run is a function of the amount of time she spends running. Giselle runs 3 miles in 21 minutes. Assume she runs at a constant
More informationAn Introduction to Bilevel Programming
An Introduction to Bilevel Programming Chris Fricke Department of Mathematics and Statistics University of Melbourne Outline What is Bilevel Programming? Origins of Bilevel Programming. Some Properties
More informationSTRAT. A Program for Analyzing Statistical Strategic Models. Version 1.4. Curtis S. Signorino Department of Political Science University of Rochester
STRAT A Program for Analyzing Statistical Strategic Models Version 1.4 Curtis S. Signorino Department of Political Science University of Rochester c Copyright, 2001 2003, Curtis S. Signorino All rights
More informationTHE EFFECT OF SEGREGATION IN NON- REPEATED PRISONER'S DILEMMA
THE EFFECT OF SEGREGATION IN NON- REPEATED PRISONER'S DILEMMA Thomas Nordli University of South-Eastern Norway, Norway ABSTRACT This article consolidates the idea that non-random pairing can promote the
More informationA Game Theoretic Study of Energy Efficient Cooperative Wireless Networks
A Game Theoretic Study of Energy Efficient Cooperative Wireless Networks Donald Richard Brown III and Fatemeh Fazel Abstract: In wireless networks, it is well-known that intermediate nodes can be used
More informationA Self-Learning Repeated Game Framework for Optimizing Packet Forwarding Networks
A Self-Learning Repeated Game Framework for Optimizing Packet Forwarding Networks Zhu Han, Charles Pandana, and K.J. Ray Liu Department of Electrical and Computer Engineering, University of Maryland, College
More informationConvergence Issues in Competitive Games
Convergence Issues in Competitive Games Vahab S Mirrokni 1, Adrian Vetta 2 and A Sidoropoulous 3 1 Computer Science and Artificial Intelligence Laboratory (CSAIL), MIT mail: mirrokni@theorylcsmitedu 2
More informationThe Implication of Overlay Routing on ISPs Connecting Strategies
The Implication of Overlay Routing on ISPs Connecting Strategies Graduate School of Information Science and Technology, Osaka University Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, and Hirotaka Nakano IP
More informationFast-Lipschitz Optimization
Fast-Lipschitz Optimization DREAM Seminar Series University of California at Berkeley September 11, 2012 Carlo Fischione ACCESS Linnaeus Center, Electrical Engineering KTH Royal Institute of Technology
More informationA Game Theoretic Approach to Network Coding
IW 2009, Volos, Greece, June 10-12, 2009 A Game heoretic Approach to Network Coding Jason R. Marden and Michelle Effros Abstract We introduce a game theoretic framework for studying a restricted form of
More informationOn 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 informationOptimal 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 informationPractice Test - Chapter 6
1. Write each system of equations in triangular form using Gaussian elimination. Then solve the system. Align the variables on the left side of the equal sign. Eliminate the x-term from the 2nd equation.
More informationCPSC 340: Machine Learning and Data Mining. Principal Component Analysis Fall 2016
CPSC 340: Machine Learning and Data Mining Principal Component Analysis Fall 2016 A2/Midterm: Admin Grades/solutions will be posted after class. Assignment 4: Posted, due November 14. Extra office hours:
More informationModelling competition in demand-based optimization models
Modelling competition in demand-based optimization models Stefano Bortolomiol Virginie Lurkin Michel Bierlaire Transport and Mobility Laboratory (TRANSP-OR) École Polytechnique Fédérale de Lausanne Workshop
More informationStrategic Network Formation
Strategic Network Formation Sanjeev Goyal Christ s College University of Cambridge Indian Institute of Science Bangalore Outline 1. Structure of networks 2. Strategic foundations of networks 3. Theory
More informationFast Convergence of Regularized Learning in Games
Fast Convergence of Regularized Learning in Games Vasilis Syrgkanis Alekh Agarwal Haipeng Luo Robert Schapire Microsoft Research NYC Microsoft Research NYC Princeton University Microsoft Research NYC Strategic
More informationCOMMUNITY UNIT SCHOOL DISTRICT 200
COMMUNITY UNIT SCHOOL DISTRICT 200 Regular Math Middle School Grade 8 1. Subject Expectation (State Goal 6) Essential Learning 1 (Learning Standard A) (Learning Standard D) Students will be able to demonstrate
More informationEC422 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 informationUsing Game Theory To Solve Network Security. A brief survey by Willie Cohen
Using Game Theory To Solve Network Security A brief survey by Willie Cohen Network Security Overview By default networks are very insecure There are a number of well known methods for securing a network
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationCoalition Formation towards Energy-Efficient Collaborative Mobile Computing. Liyao Xiang, Baochun Li, Bo Li Aug. 3, 2015
Coalition Formation towards Energy-Efficient Collaborative Mobile Computing Liyao Xiang, Baochun Li, Bo Li Aug. 3, 2015 Collaborative Mobile Computing Mobile offloading: migrating the computation-intensive
More informationComplexity in Network Economics
Complexity in Network Economics The notion of complexity (in) science has become a bit fuzzy over time. Thus, in this talk I want to shed some light on its meaning, its paradigmatic implication for research
More informationCPSC 340: Machine Learning and Data Mining. Principal Component Analysis Fall 2017
CPSC 340: Machine Learning and Data Mining Principal Component Analysis Fall 2017 Assignment 3: 2 late days to hand in tonight. Admin Assignment 4: Due Friday of next week. Last Time: MAP Estimation MAP
More informationAnalysis and Modeling
Guillaume Guérard A Complex System Approach for SMART GRID Analysis and Modeling KES 12 September 2012 1 Problematic Thesis: Optimization in complex networks. Problem: Optimization of the energy distribution
More informationAlgorithms for simple stochastic games
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School 2009 Algorithms for simple stochastic games Elena Valkanova University of South Florida Follow this and additional
More informationDetection and Mitigation of Cyber-Attacks using Game Theory
Detection and Mitigation of Cyber-Attacks using Game Theory João P. Hespanha Kyriakos G. Vamvoudakis Correlation Engine COAs Data Data Data Data Cyber Situation Awareness Framework Mission Cyber-Assets
More informationOrganic Self-organizing Bus-based Communication Systems
Organic Self-organizing Bus-based Communication Systems, Stefan Wildermann, Jürgen Teich Hardware-Software-Co-Design Universität Erlangen-Nürnberg tobias.ziermann@informatik.uni-erlangen.de 15.09.2011
More informationLecture 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 informationResource 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 informationGame 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 informationSYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)
Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called
More informationSocial Science/Commerce Calculus I: Assignment #6 - Solutions Page 1/14
Social Science/Commerce Calculus I: Assignment #6 - Solutions Page 1/14 3 1. Let f (x) = -2x - 5x + 1. Use the rules of differentiation to compute: 2 The first derivative of f (x): -6x - 5 The second derivative
More informationSecure Message Delivery Games for Device-to-Device Communications
Secure Message Delivery Games for Device-to-Device Communications GameSec 2014 Manos Panaousis November 6, 2014 Manos Panaousis (University of Brighton) GameSec 14 November 6, 2014 1 / 20 Future smartphones
More information