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

Slides:



Advertisements
Similar presentations
Policies & Procedures Mrs. Gales’ Class.
Advertisements

GAME THEORY.
How to Schedule a Cascade in an Arbitrary Graph F. Chierchetti, J. Kleinberg, A. Panconesi February 2012 Presented by Emrah Cem 7301 – Advances in Social.
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.
Welcome to this experiment on decision making Centre for Ecological and Evolutionary Studies dept. of Theoretical Biology.
Mrs. Williams’ Classroom Rules & Procedures
Where you sit today… is where you stay! Welcome to class! Do not turn on the computers!
Welcome to 8 th grade science!. All about Mr. Nelson I grew up in Crystal Lake I graduated From Carroll University (Waukesha, Wisconsin) Taught 8 th grade.
ATTENTION SIGNAL Voices off. Stop what you’re doing. Eyes on teacher. Follow teacher directions.
Ms. Forbes’ Hints for Success Classroom Procedures & Behavior.
Instructions First-price No Communication treatment.
KINGS COUNTY TENNIS LEAGUE Davis Cup Tennis Instructions Communicate to your site leader for any clarification you may need. Please report to your specific.
Section 1.7: Coloring Graphs
Copy procedures in your Agenda Book in the NOTES section. USE PENCIL ONLY! Title: Classroom Procedures.
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.
Behavioral Graph Coloring Tue Jan 24 & Wed Jan PM 207 Moore Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
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.
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.
Experiments in Behavioral Network Science 2: Some Preliminary Analysis of 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.
Please write all of the BLUE information down so you can remember it!
Mr. Valdés Classroom Rules. Always be Attentive in class.
IB 429 ANSC 466 ANTH 442 Animal Behavior MWF 3-3: Roger Adams Lab 1 hand out: course syllabus.
SWTJC STEM – ENGR 1201 cg - 7 Academic Success Strategies “Approach” is a key factor in any professional career preparation. A good approach is to work.
How we do things in our classroom…
Welcome to Mr. Lyons’ Classroom!. CLASSROOM RULES Respect Yourself Respect Others Respect Property Headphones should be removed before entering the classroom.
Welcome Back!!! Welcome to Ms. Payne's class  Room 117 Have a seat Begin the Warm Up Warm Up: 1. Read through the syllabus. 2. Place your schedule and.
Classwork: I will learn about Ms. Caldwell’s class by reading the Course Syllabus. Today we will: ①Complete the “Do Now” ②Fill out Questionnaire ③Read.
Presented by Qian Zou.  The purpose of conducting the experiments.  The methodology for the experiments.  The Experimental Design : Cohesion Experiments.
Welcome to 8 th grade science!. All about Mr. Nelson I grew up outside of Chicago, Illinois I graduated From Carroll University (Waukesha, Wisconsin)
Some Analysis of Coloring Experiments and Intro to Competitive Contagion Assignment Prof. Michael Kearns Networked Life NETS 112 Fall 2014.
Classroom Rules Steve Gerkey Science Effective Classroom Management and Discipline is the #1 factor in student learning achievement (R. Marzano synthesis.
Arrival Procedures Wait quietly at the computer lab door for the teacher. Do not cut through the library to the computer lab unless you are accompanied.
PHY 1405 Conceptual Physics (CP 1) Spring 2010 Cypress Campus.
COMPUTER GRAPHICS DIGITAL PHOTOGRAPHY & MULTIMEDIA with MR. LINCOLN Career & Technical Education.
Mrs. Koke Mrs. Soumah Science. * A procedure is the way that we do things. * Without procedures, students do not know what is expected of them. * To be.
Welcome to AP Bio with Mr. Jenks September 8, 2015.
Procedures There are many procedures that everyone will need to follow in this class. They will help make your life easier and will keep our classroom.
Trading in Networks: I. Model Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.
Check whether these things are on your desk. If not, please raise your hand. –Pen –Receipt –“Summary of the experiment” Fill in the receipt following the.
Conceptual Chemistry/Physics ~Mr. Lynn Most notes in this class will be given on PowerPoint, if you are having trouble reading this… move closer! Sit where.
Grand Canyon Field Trip Parent Meeting. Arrival at School Friday, May 13 5:30 am – 5:45am – Arrive at School. Please check in with your child’s teacher.
Arrival Procedures Wait quietly at the door for the teacher. When permitted, walk to your assigned computer without talking. Sit down and wait for instructions.
Classroom Rules, Procedures and Expectations Mrs. Lindquist Superior Middle School.
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013.
Mrs. Stringer’s Pre-Algebra Class. Goal for this year – Be Positive! SSLANT Method for Students and Teachers Smile Sit Up Listen Ask Questions Nod When.
IB Diploma Examinations May 2015 Final advice and explanation of conditions.
Course Expectations Values 1 Mr. Jimmy. Introduction Rules and procedures are fundamental in life (daily) There are also rules and procedures in this.
CS-171, Intro to A.I. — Quiz Instructions
6th Grade Routines, Procedures and Expectations
Networked Games: Coloring, Consensus and Voting
Classroom Procedures.
Mr. Semaya’s Classroom West Essex Middle School North Caldwell, NJ
Networked Games: Coloring, Consensus and Voting
Trading in Networks: I. Model
Grand Canyon Field Trip
Mr. Goerzen’s Classroom Rules and Class Information
Did this person learn from the homework?
Welcome to First Semester!!!
Department of Mathematics
Networked Games: Coloring, Consensus and Voting
Networked Games: Coloring, Consensus and Voting
CS-171, Intro to A.I. — Quiz Instructions
CS-171, Intro to A.I. — Exam Instructions
Sporting Lee’s Summit Referee Orientation
Which person learned from the first assignment of the year?
Presentation transcript:

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

2 Crucial Information The experiments take place tomorrow, March 16, beginning at 3 PM sharp. Please arrive a few minutes early. The location is 207 Moore. Find out how to get there well in advance. Go to the bathroom before you arrive. You are responsible for showing up if you’re on the list. No excuses.

3 Overview Experiments in collective problem-solving in network settings As with the February 16 Coloring & Consensus experiments: –each participant sits at a workstation and interacts with others only through the system –each participant controls the behavior of a single vertex in a network of 36 vertices –each participant has only a local, “first neighborhood” view You see your own vertex, your neighbors (black edges), and connections between neigbhors (red edges) each neighbor annotated by their number of non-local, “invisible” neighbors –network structure changes from experiment to experiment –two different game types (even more closely related than Feb 16) Our immediate agenda: –background and information for game players –system walk-through –compensation details –logistics, ground rules, etc. Please ask questions if you have them!

4 Kings and Pawns, Version 1 Each player controls a vertex Player action is to choose to be either a “King” or a “Pawn” Being a King pays more highly than being a Pawn --- unless you have a neighboring King Furthermore, pay is accumulated continuously at a rate that depends on your current choice and those of your neighbors Payment rates: –$1 per minute for being a King with no neighboring King (“Lone King”) –$0.50 per minute for being a Pawn –$0 per minute for being a King with a neighboring King (“Fighting King”) –Again, rates are expressed per minute, but are accumulated continuously! All games will last exactly 2 minutes --- no early stopping! –Unlike Coloring and Consensus, all players receiving max possible payoff no possible 19 experiments total In principle, an individual could make $38 on Version 1

5

6

7

8 Version 2: Kings and Pawns with “Tips” Same as before, but now Kings can offer “tips” or side payments to neighboring pawns A Solo King can offer any fraction of its $2/minute to neighboring pawns This fraction will be split equally among all neighboring pawns –no differential tips Payment rates: –$1/min – tips for being a Lone King –$0.50/min + tips (summed over all neighboring Lone Kings) for being a Pawn –$0/min for being a Fighting King –Again, payment accumulated continuously based on current state All games will last exactly 2 minutes; no early stopping 19 experiments total Individuals could again make $38 on Version 2

9

10

11

12 A Related Computational Problem For any network or graph G, an independent set in G is a set S of vertices such that no pair of vertices in S are connected by an edge in G The “opposite” or dual of a clique Maximum independent set: largest possible in G Computationally difficult to compute a maximum independent –even for centralized computation Relationship to Kings and Pawns: –expensive of being a Conflicting King + Pawn profit  encourages Kings to be an independent set –most profitable to be a Solo King  encourages set of Kings to be as large as possible –in particular, maximum social welfare achieved by a maximum independent set However, play however you like!

13 Important Notes Experiments are tomorrow (Fri March 16) at 3 PM Experiments will take place in the workstation lab of 207 Moore. Please find out how to get there well in advance We will begin seating for the experiments at 3 PM SHARP. –At 3:05, we will stop giving credit for participating. –Don't be late. –GO TO THE BATHROOM BEFORE YOU ARRIVE You must be present for the entire session in order to receive compensation or credit –3 PM end time is only approximate –If you can’t stay for the entire session, don’t come and let us know NOW There will be various ground rules you are expected to follow –No talking, except to raise hand an ask questions of proctors –No other attempts at communication with other participants –No doing anything with the computers except as instructed –Pay full attention at all times: no reading material, iPods, etc. –TURN YOUR CELL PHONES OFF –Best model for how to behave: Pretend this is a final exam Violations will result in dismissals without compensation or credit