An analysis of innocent interaction

Russ Harmer (1)

1 PPS - Preuves, Programmes et Systèmes

We present two abstract machines for innocent interaction. The first, a rather complicated machine, operates directly on innocent strategies. The second, a far simpler machine, requires a “compilation” of the innocent strategies into “cellular” strategies before use. Given two innocent strategies, we get the same final result if we make them interact using the first machine or if we first cellularize them then use the other machine.

Domaines: Informatique et théorie des jeux [cs.GT]; Logique en informatique [cs.LO]

Russ Harmer. An analysis of innocent interaction. 2nd International Workshop on Games for Logic and Programming Languages (GALOP), 2006, Seattle, United States. ⟨hal-00150355⟩