Skip to main content
Article thumbnail
Location of Repository

An analysis of innocent interaction

By Russ Harmer

Abstract

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

Topics: [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: HAL CCSD
Year: 2006
OAI identifier: oai:HAL:hal-00150355v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.