This course is given by Andrzej Pelc (http://w3.uqo.ca/pelc/main.html).
Tradeoffs between the amount of information available to an algorithm solving a given task and the complexity of the solution.
#### 1. Introduction
1. Introduction
2. Advice given to nodes
3. Advice given to a single agent
4. Advice given to many agents
#### 2. Algorithms for mobile agents.
Summary:
Algorithms for tasks such as rendezvous, gathering and exploration executed by mobile agents in networks modelled as graphs or in the plane.
1. Introduction
2. Taxonomy of rendezvous problems
3. Synchronous rendezvous
4. Asynchronous rendezvous
#### 3. Strategies for the Iterated Prisoner's Dilemma
Summary:
Introduction to the IPD problem and analysis of good strategies for it.
1. Introduction to the IPD problem
2. The model
3. Robust strategies
4. Implementation issues
#### 4. Written exam (90 minutes).
### Schedule
* April 13 --- 4h
* April 15 --- 4h
* April 16 --- 2h
* April 20 --- 4h
* April 22 --- 4h
* April 20 --- 2h written exam
