Prisoners Dilemma Tournaments

The next meeting will take place on the 15.11. at 20:00 at the Tunnel Vienna.
The topic this time is going to be: Prisoners Dilemma Tournaments

Please have a look at the literature provided:

1)  Definition and Basic Game Theory of the Prisoners Dilemma

http://policonomics.com/lp-game-theory2-prisoners-dilemma/

This website contains a lot of information on game theory in general and gives an introduction. You can read the linked page but also proceed to further topics or clarify certain terms in previous basic chapters. In the NWC however we will focus on the concept of the Prisoners Dilemma.

2) Expand the concept: Iterated Prisoners Dilemma

The case becomes interesting once the Dilemma is iterated several times and/or played among different people using their own strategy. The optimal strategies in such tournaments lead to different interpretation and have significance in many fields. Here are 3 articles presenting different successful strategies. All shortly review what the Prisoners Dilemma is ( you might want to skip these parts )

Tit for Tat and altruism:
https://www.forbes.com/sites/rogerkay/2011/12/19/generous-tit-for-tat-a-winning-strategy/
Zero Determinant Games and the evolution of cooperation:
https://www.quantamagazine.org/game-theory-explains-how-cooperation-evolved-20150212/
Tribalism and the importance of communication:
http://nautil.us/issue/52/the-hive/is-tribalism-a-natural-malfunction

Additionally: These are some online Simulators to check the payoff of your own strategies.  Hope you manage to navigate through the Interface.

http://www.iterated-prisoners-dilemma.net/
http://www.spatialised-prisoners-dilemma.net

3) Sourcecodes

Stanfords Plato:https://plato.stanford.edu/entries/prisoner-dilemma/

A generalization of the IPD is allowing strategies chosen due to probabilities. The so called Stochastic Iterated Prisoner Dilemma has quite a mathematical body (see also zero determinant games). Take a dip with google!

Additional historic information on IPD Tournaments:

https://egtheory.wordpress.com/2015/03/02/ipd/
http://axelrod.readthedocs.io/en/stable/reference/description.html

If you proceed on this page with NEXT you will find all the different strategies together with their code which took stage during Axelrods first IPD Contest.

Advertisements

Social implications of AI

The next and last meeting for this semester will take place on the 30.6. at 18:00 at the Tunnel Vienna.
Since we probably don’t see each other till October, we figured it would be nice to have a “home exercise” for the summer (like last year). Therefore I’d like to ask you for suggestions. If there is any literature you think is interesting, let us know. On the next meeting we will then choose together which one we want to read over the summer. Besides that we also will send out a collection of all suggestions.

For our this times meeting Nino prepared the topic Social implications of AI. Please have a look at the literature provided:

1)
Kurzgesagt Video:
https://www.youtube.com/watch?v=WSKi8HfcxEk
CGP-Grey Video:
https://www.youtube.com/watch?v=7Pq-S557XQU
2)
Wait-But-Why Blog Part 1&2:
http://waitbutwhy.com/2015/01/artificial-intelligence-revolution-1.html
http://waitbutwhy.com/2015/01/artificial-intelligence-revolution-2.html
3)
Paper on AI-Safety:
https://arxiv.org/abs/1606.06565
“The focus of the discussion should not be if and how a general AI is technological feasible but on the social implications of automation and the rapid improvement of AI’s”

P vs. NP Problem

At our next meeting on 28th November we will discuss the P vs. NP problem of complexity theory presented by Thomas Zauner. There are several levels of readings.

Level 1
Watch this video explaining the basics about the P vs. NP problem and complexity theory.

Level 2a
Read this article explaining not only the concepts, but also shedding some light on recent developments in research.
http://cacm.acm.org/magazines/2009/9/38904-the-status-of-the-p-versus-np-problem/fulltext

Level 2b
Watch these excellent and well explained lecture video on an introduction complexity. 
https://www.youtube.com/watch?v=moPtwq_cVH8
(For further studies see: https://www.youtube.com/watch?v=eHZifpgyH_4)

Level 3
For further reading consult the always-insightful Stanford encyclopedia of philosophy.
http://plato.stanford.edu/entries/computational-complexity/