Daniel Ariosa Ecole Polytechnique Fédérale de Lausanne (EPFL) Institut de Physique de la Matière Complexe CH-1015 Lausanne, Switzerland and Hugo Fort Instituto.

Slides:



Advertisements
Similar presentations
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Advertisements

This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
An Introduction to... Evolutionary Game Theory
NSPCS 2012 (KIAS, Seoul, 3 Jul ~ 6 July) Cooperative hierarchical structures emerging in multiadaptive games & Petter Holme (Umeå University, SungKyunKwan.
Common Welfare, Strong Currencies and the Globalization Process Esteban Guevara Hidalgo Center for Nonlinear and Complex Systems (Como, Italy) ICTP-TRIL.
Evolutionary Game Algorithm for continuous parameter optimization Alireza Mirian.
EKONOMSKA ANALIZA PRAVA. Game Theory Outline of the lecture: I. What is game theory? II. Elements of a game III. Normal (matrix) and Extensive (tree)
Automata-based adaptive behavior for economic modeling using game theory Rawan Ghnemat, Khalaf Khatatneh, Saleh Oqeili Al-Balqa’ Applied University, Al-Salt,
Myopic and non-myopic agent optimization in game theory, economics, biology and artificial intelligence Michael J Gagen Institute of Molecular Bioscience.
An RG theory of cultural evolution Gábor Fáth Hungarian Academy of Sciences Budapest, Hungary in collaboration with Miklos Sarvary - INSEAD, Fontainebleau,
Cooperation in Anonymous Dynamic Social Networks Brendan Lucier University of Toronto Brian Rogers Northwestern University Nicole Immorlica Northwestern.
Games What is ‘Game Theory’? There are several tools and techniques used by applied modelers to generate testable hypotheses Modeling techniques widely.
On Quantum Walks and Iterated Quantum Games G. Abal, R. Donangelo, H. Fort Universidad de la República, Montevideo, Uruguay UFRJ, RJ, Brazil.
Fundamentals of Political Science Dr. Sujian Guo Professor of Political Science San Francisco State Unversity
EC – Tutorial / Case study Iterated Prisoner's Dilemma Ata Kaban University of Birmingham.
Institutions and the Evolution of Collective Action Mark Lubell UC Davis.
Algoritmi per Sistemi Distribuiti Strategici
Temporal Action-Graph Games: A New Representation for Dynamic Games Albert Xin Jiang University of British Columbia Kevin Leyton-Brown University of British.
A Memetic Framework for Describing and Simulating Spatial Prisoner’s Dilemma with Coalition Formation Sneak Review by Udara Weerakoon.
Games as Systems Administrative Stuff Exercise today Meet at Erik Stemme
Why How We Learn Matters Russell Golman Scott E Page.
XYZ 6/18/2015 MIT Brain and Cognitive Sciences Convergence Analysis of Reinforcement Learning Agents Srinivas Turaga th March, 2004.
Human Social Dilemmas Cooperation Between Non-Relatives Complex Evolutionary Problem Repeated Interaction, Conditional Cooperation Human Cooperation Often.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Monte Carlo Simulation of Ising Model and Phase Transition Studies
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
Magnetism III: Magnetic Ordering
Presentation in course Advanced Solid State Physics By Michael Heß
Monte Carlo Simulation of Ising Model and Phase Transition Studies By Gelman Evgenii.
MAKING COMPLEX DEClSlONS
Physics Fluctuomatics (Tohoku University) 1 Physical Fluctuomatics 7th~10th Belief propagation Appendix Kazuyuki Tanaka Graduate School of Information.
Learning in Multiagent systems
Models and Algorithms for Complex Networks Power laws and generative processes.
Dynamical Replica Theory for Dilute Spin Systems Jon Hatchett RIKEN BSI In collaboration with I. Pérez Castillo, A. C. C. Coolen & N. S. Skantzos.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
自旋玻璃与消息传递算法 Spin Glass and Message-Passing Algorithms 周海军 中国科学院理论物理研究所.
Equilibria in Network Games: At the Edge of Analytics and Complexity Rachel Kranton Duke University Research Issues at the Interface of Computer Science.
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
Equilibrium transitions in stochastic evolutionary games Dresden, ECCS’07 Jacek Miękisz Institute of Applied Mathematics University of Warsaw.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Game Theory by James Crissey Luis Mendez James Reid.
Graduate School of Information Sciences, Tohoku University
The Role of Altruistic Punishment in Promoting Cooperation
Network Science K. Borner A.Vespignani S. Wasserman.
Evolving Strategies for the Prisoner’s Dilemma Jennifer Golbeck University of Maryland, College Park Department of Computer Science July 23, 2002.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
UNIVERSITA’ DEGLI STUDI NAPOLI FEDERICO II DOTTORATO IN INGEGNERIA DEI MATERIALI E DELLE STRUTTURE Brunella Corrado Filomena Gioiella Bernadette Lombardi.
University of Papua New Guinea Principles of Microeconomics Lecture 13: Oligopoly.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Capital Deepening and Nonbalanced Economic Growth Presenter: Dai, Qian.
Ch 2. THERMODYNAMICS, STATISTICAL MECHANICS, AND METROPOLIS ALGORITHMS 2.6 ~ 2.8 Adaptive Cooperative Systems, Martin Beckerman, Summarized by J.-W.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Game Theory and Cooperation
Computational Physics (Lecture 10)
Statistical-Mechanical Approach to Probabilistic Image Processing -- Loopy Belief Propagation and Advanced Mean-Field Method -- Kazuyuki Tanaka and Noriko.
Project BEST Game Theory.
In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok
CASE − Cognitive Agents for Social Environments
The outbreak of cooperation among success-driven individuals under noisy conditions Success-driven migration and imitation as a driver for cooperative.
Boltzmann Machine (BM) (§6.4)
Adaptive Cooperative Systems Chapter 3 Coperative Lattice Systems
Biointelligence Laboratory, Seoul National University
M9302 Mathematical Models in Economics
Presentation transcript:

Daniel Ariosa Ecole Polytechnique Fédérale de Lausanne (EPFL) Institut de Physique de la Matière Complexe CH-1015 Lausanne, Switzerland and Hugo Fort Instituto de Física, Facultad de Ciencias Universidad de la República Montevideo, Uruguay Statistical Mechanics Applied to Social Sciences ____________________________________

Introduction n Estimating Utilities: Magnetic Systems and Games People Play n... and Adaptive Self-Interested Agents n Extended Estimator Approach for 2x2 Games and its Mapping to the Ising Hamiltonian

Outline n Self-organization into cooperative equilibrium states n The extended estimator formulation n Mapping the iterated game into an Ising model n Classifying Markovian Strategies n Stability of cooperation - Asynchronous random dynamics -Synchronous fully connected system n Thermodynamics of Ising mappable strategies n Discussion

Self-organization into cooperative equilibrium states n How populations of self interested agents cooperate, or manage in order to satisfy this goal globally or collectively ? n A few examples: - electrons in a superconductor - local magnetic moments in a ferromagnet - molecules that cooperate to form cells, cells that cooperate to form living creatures that in turn cooperate to form societies... n Different approaches: n Different approaches (paradigms and extremal principles): - Biology  Darwin’s evolution  fitness maximization - Economics  « Homo economicus »  profit maximization - Physics  statistical thermodynamics  free energy minimization

n Game theory and the Prisoner’s dilemma - The Prisoner’s dilemma models the social behavior of "selfish" individuals - 2x2 game in normal form: i) 2 players, each confronting 2 choices : to cooperate (C) or to defect (D) ii) each player makes his choice without knowing what the other will do iii) there is a 2  2 matrix specifying the payoffs of each player for the 4 possible outcomes: With the condition and

Elementary Markovian strategies and estimates ( aspiration levels ) for iterated games _____________________________________________ -The player updates its behavior (C or D) according to the outcome of the preceding run. - A simple updating rule (= strategy) consists in comparing the obtained utilities (  ) with a given estimate (   ) for the expected income. - Example: The “PAVLOV” strategy Behavior: “win-stay, lose-shift” Estimate: P <   < R Character: 

-more examples: “Retaliator” strategy: -Behavior: retaliates when the other player defects - Estimate: S <   < P - Character “Tit-for-Tat” strategy: -Behavior: cooperate on the first move an then reproduce what the other player did In the preceding move. - Estimate (conditional): S P * ; R > R * ; T < T * - Character: S* T* R* P* Retaliator

The extended estimator formulation - Behavior (state):  “SPIN”: -Estimate  Estimator payoff matrix(EPM): - Updating rule:player(i) FLIPS 

Mapping the iterated game into an Ising model ______________________________ Ising spin Story line:two-valued variable  Ising spin Metropolis updating rule for c  Metropolis algorithm algorithm (T=0) Flipping condition:

The Ising Hamiltonian: Energy density associated with the flip: The link:

Explicit form of the utilities: - when playing against a single player (j): - when playing against z nearest neighboring (nn) players: - In terms of the Ising variables: and

The mapping: 11 22

Classifying Markovian strategies

Stability of cooperation __________________________________ Average cooperation: Fraction c of agents in the C-state a) Steady state cooperation (asymptotic): c* b) Ground state cooperation (equilibrium at T=0): c eq Synchronous Dynamics: All agents simultaneously update their states in one round. Asynchronous Dynamics: The update is carried out by the subset of agents who just played.

A pair of players is randomly chosen for each round. Stability in Asynchronous Random Dynamics (ARD): Example for the PAVLOV ( )strategy: Only c* = 1/2 is a stable solution (for all but one cooperating agents, the system is rapidly driven away from c = 1.)

Asynchronous Random Dynamics (ARD):

Stability in the Synchronous Fully Connected System (SFC): A) The FES case The equilibrium sate strongly depends upon the initial configuration. Obtained utilities as a function of c : A stable configuration is reached when all players get a payoff  greater than the estimate  or, in other words, when  is lower than the cooperator’s utilities. Marginal stability is reached also when all players defect and  is lower than the defector’s utilities.

Phase diagram for the FES case

steady state Phase diagram for the steady state cooperation in IMS

Thermodynamics of Ising-mappable strategies Fully connected system(z=N-1): Free energy functional in terms of mapping parameters:

Mean field approximation: Partition function: Average magnetization:

ground state Phase diagram for the ground state cooperation in IMS

Summary All the relevant elementary Markovian strategies for the Prisoner’s dilemma have been formulated in terms of an extended (conditional) estimate. Another subset (AD ; TFT ; CON ; AC) has been mapped on an Ising Hamiltonian with 2 parameters. The remaining (7) strategies can also be formulated in terms of estimators involving more than two parameters (3, 4). A straightforward application of the thermodynamic approach of IMS consists of finding the ground state cooperation of complex systems of interacting agents, which is clearly different from the steady state of the iterated game. Finite temperature leads to “generous” strategies allowing more efficient equilibrium states in its “fitness” landscape. A subset of these strategies (FR ; RET ; PAV ; AMB ; ALT) admits a fixed (single) estimate.

Future work: The mapping on Hamiltonian systems can be exploited in many ways: - Replacing the two valued state [C or D] by a continuous variable (more rich systems as the XY model) - Evolution (Darwinian) and learning models: Instead of cooperation, consider the strategy (eg. the FES  *) as the site variable (order parameter?). Within this context, thermal fluctuations represent spontaneous “mutations” and the Boltzman energy factor will operate the selection. - Heterogeneous estimates varying from site to site (eg. spin glass model)