Experiments in Behavioral Network Science 2: Some Preliminary Analysis of Kings and Pawns Networked Life CSE 112 Spring 2007 Michael Kearns & Stephen Judd.

Slides:

Advertisements

Similar presentations

The Maze Game 2.0 Not recommended for young children (contains sudden threats) By The Sd.

Advertisements

Competitive Contagion Scoring Review Let P be the population distribution of seed choices on graph G For every seed set s that appears with non-zero probability.

MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)

Game Theory. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.

Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide

Analysis of Social Media MLD , LTI William Cohen

“Teach A Level Maths” Statistics 1

Independent Events. These situations are dealing with Compound events involving two or more separate events. These situations are dealing with Compound.

Orange Boat 3Purple Boat 4Red Boat 5Yellow Boat 6Green Boat 2Blue Boat 1.

Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.

CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:

Probabilities of Dependent Events. Determining probabilities of dependent events is usually more complicated than determining them for independent events.

Behavioral Experiments in Networked Games Networked Life CIS 112 Spring 2008 Prof. Michael Kearns Collaborators: Stephen Judd Siddharth Suri Nick Montfort.

Behavioral Experiments in a Network Formation Game Prof. Michael Kearns Networked Life Spring 2010.

Experiments in Behavioral Network Science: Brief Coloring and Consensus Postmortem (Revised and Updated 4/2/07) Networked Life CSE 112 Spring 2007 Michael.

Network VCM progress report. =============================================================== ===============================================================

Behavioral Experiments in Network Science Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.

Experiments in Behavioral Network Science Networked Life CSE 112 Spring 2007 Michael Kearns & Stephen Judd.

Behavioral Network Science Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.

Midterm II Solution Prof. Mohamed Batouche Department of Computer Science CCIS – King Saud University Saudi Arabia.

Experiments in Behavioral Network Science 2: Kings and Pawns Networked Life CSE 112 Spring 2007 Michael Kearns & Stephen Judd.

Behavioral Graph Coloring Michael Kearns Computer and Information Science University of Pennsylvania Collaborators: Nick Montfort Siddharth Suri Special.

Adv Graphical Enablement In this presentation… –Working with color schemes. –Working with newlook filters. –Tips to assist recognition of the iSeries 5250.

What is the probability of the following: Answer the following: 1. Rolling a 4 on a die 2. Rolling an even number on a die 3. Rolling a number greater.

Trading in a Pit Market Introduction to Demand and Supply.

Combinations with repetitions allowed Red, green and blue cubes are given. There are at least five cubes of each of the above colors. In how many ways.

Digital Terminology. Bitmap A representation consisting of rows and columns of dots of a graphic image stored in computer memory. To display a bitmap.

Find the probability and odds of simple events.

Math The Multiplication Rule for P(A and B)

Place Value Kim Burns. Chip-Trading Games Use chip-trading games to teach place value. These games stress the idea of exchanging many for one. The values.

Presented by Qian Zou.  The purpose of conducting the experiments.  The methodology for the experiments.  The Experimental Design : Cohesion Experiments.

Lecture # 6 Forms, Widgets and Event Handling. Today Questions: From notes/reading/life? Share Personal Web Page (if not too personal) 1.Introduce: How.

Some Analysis of Coloring Experiments and Intro to Competitive Contagion Assignment Prof. Michael Kearns Networked Life NETS 112 Fall 2014.

4.3 Binomial Distributions. Red Tiles and Green Tiles in a Row You have 4 red tiles and 3 green tiles. You need to select 4 tiles. Repeated use of a tiles.

Teacher Resources  Chapter 14 Color Teaching Transparency —Ch 14.2a Ch 14.2bCh 14.2aCh 14.2b  Laboratory Black line Masters Laboratory Black line Masters.

1.5 Independent and Dependent Events. Flipping a Coin.

Trading in Networks: I. Model Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.

Instructions for using this template. Remember this is Jeopardy, so where I have written “Answer” this is the prompt the students will see, and where.

PowerPoint Presentation By Mr. Michael Braverman Haverford Middle School School District of Haverford Township Havertown, PA 1903 Scale Factors.

Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013.

Introduction to Probability – Experimental Probability.

Directions: 1.Divide the class into two teams: X’s & O’s. Begin the game. 2.Once all characters have been introduced, you will come to a screen with all.

5-Minute Check on Section 6-2a Click the mouse button or press the Space Bar to display the answers. 1.If you have a choice from 6 shirts, 5 pants, 10.

NETWORK FLOWS Shruti Aggrawal Preeti Palkar. Requirements 1.Implement the Ford-Fulkerson algorithm for computing network flow in bipartite graphs. 2.For.

Seeing in colour Stare at the coloured dot in the middle of the next picture for a minute. Then describe what you see when you look at the next slide.

Expected Value and Fair Game S-MD.6 (+) Use probabilities to make fair decisions (e.g., drawing by lots, using a random number generator). S-MD.7 (+) Analyze.

Networked Games: Coloring, Consensus and Voting

Networked Games: Coloring, Consensus and Voting

Trading in Networks: I. Model

How to Start This PowerPoint® Tutorial

The Colour of Light: Additive colour theory.

Obj: To learn about how we see colours

From: Perceptual entrainment of individually unambiguous motions

Journal of Vision. 2008;8(11):18. doi: / Figure Legend:

Seeing in colour Stare at the coloured dot in the middle of the next picture for a minute. Then describe what you see when you look at the next slide.

How to Start This PowerPoint® Tutorial

Networked Games: Coloring, Consensus and Voting

Mark E.J. Sheffield, Michael D. Adoff, Daniel A. Dombeck Neuron

Networked Games: Coloring, Consensus and Voting

Two ways to discuss color 1) Addition 2) Subtraction

15 seconds left 30 seconds left 3 minutes left 2 minutes left 1 minute

Directions: Color your name with any tiles you want.

Activity in Posterior Parietal Cortex Is Correlated with the Relative Subjective Desirability of Action Michael C. Dorris, Paul W. Glimcher Neuron

Align The Stars Continue.

“Teach A Level Maths” Statistics 1

Click the mouse button or press the Space Bar to display the answers.

Align The Stars Continue.

COMS 161 Introduction to Computing

Figure 1. Probabilistic learning task

Presentation transcript:

Experiments in Behavioral Network Science 2: Some Preliminary Analysis of Kings and Pawns Networked Life CSE 112 Spring 2007 Michael Kearns & Stephen Judd

2 Summary of Events Held 2 x 19 Kings and Pawns experiments First 19 with simpler, no-tips mechanism Second 19 with tips by kings permitted –Glitch in this interface! –When a King, sometimes had to click on Pawn to discover payoff –Announced and explained the bug; restarted second set of games 19 different networks –Each run once under no-tips and tips mechanisms – 1 network of 18 isolated pairs –3 preferential attachment trees –3 denser preferential attachments –3 Erdos-Renyis –3 bipartite networks –3 trials of chain of 6-cliques –6 chains of 6-cliques with 20% random rewiring Questions –Did the tips influence behavior and performance? –Did network structure influence behavior and performance? –Many, many others…

3 Chain of 6-CliquesIsolated PairsRewired ChainP.A. Tree Dense P.A.Erdos-RenyiBipartite

4 Chain of 6-CliquesIsolated PairsRewired ChainP.A. Tree Dense P.A.Erdos-RenyiBipartite

5 corrected!

6 Next 6 Slides Each slide corresponds to one of six different network generation models –e.g. preferential attachment trees, Erdos-Renyi, etc. Each row corresponds to one of three trials of networks of that type Left column: for the non-tips trial, –number of Kings vs. time (blue curve) –number of fighting Kings vs. time (red curve, always less than blue curve) Middle column: same as left, but for tips trial Right column: average rate of pay per player per minute vs. time, –non-tips: black –tips: green –computed as (#kings - #fighting kings)x$1 + (#pawns)x$0.50

7 P.A. tree (max ~ 0.86)

8 Bipartite (max 0.75)

9 Dense P.A. (max ~ 0.73)

10 Erdos-Reyni (max ~ 0.70)

11 Clique Chain (max ~ 0.59)

12 Rewired Chain (max ~ 0.66)

13 Competitive Ratio (=total payoff/max possible in network): non-tips (x) vs. tips (y) (1: PA trees; 3: Dense PA; E: Erdos-Renyi; B: Bipartite; 0: Clique Chain; 20: Rewired Chain; P: Pairs)

14 Competitive Ratios in Order of Experiments: non-tips (cyan), tips (magenta) (1: PA trees; 3: Dense PA; E: Erdos-Renyi; B: Bipartite; 0: Clique Chain; 20: Rewired Chain; P: Pairs)

15 Cumulative and Max Instantaneous Competitive Ratios in Order of Experiments: cumulative (two leftmost bars in each group of four); instantaneous (rightmost two bars) (1: PA trees; 3: Dense PA; E: Erdos-Renyi; B: Bipartite; 0: Clique Chain; 20: Rewired Chain; P: Pairs)

16

17

18

19

20

21

22

23

24

25