Title: Boolean Network Games
Speaker: Prof. Jeremy Seligman (The University of Auckland)
Date & Time : 13 July 2015 (Monday), 09:00 – 11:00
Place: Seminar room 259, Main Teaching Building, Xixi campus, Zhejiang University

Communication can be regarded as a game in which agents choose repeatedly between signals that are transmitted to other agents, with possibility varying objectives. A very simple example of this is the model of negotiation proposed and studied experimentally by Kearns, Suri and Montfort (2006). In this, agents get to choose repeatedly between “colours” with the objective of eventually being a different colour to each of their neighbours. We propose a framework for modelling communication in this way and draw some technical comparisons with existing work in computer science on iterated Boolean games (Gutierrez, Harrenstein, and Wooldridge, 2014). Joint work with Declan Thompson (Auckland).