In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. No longer can we assume that moves of Player and Opponent alternate. Rather the history of a play more naturally takes the form of a partial order of dependency between occurrences of moves. How are we to define strategies within such a game, and how are we to adjoin probability to such a broad cla...

Building on a new definition and characterization of probabilistic event structures, a general definition of distributed probabilistic strategies is proposed. Probabilistic strategies are shown to compose, with probabilistic copy-cat strategies as identities. A higher-order probabilistic process language reminiscent of Milner’s CCS is interpreted within probabilistic strategies. W.r.t. a new de...

A summary of work on distributed games and strategies done within the first three years of the ERC project ECSYM.

In one-on-one tutoring sessions, lessons are sometimes distributed across several interaction episodes. We observed recurring patterns in the way that physics tutors parcel dialogue sub-goals between problem-solving discussions and post-solution, reflective discussions. We call these patterns “distributed tutorial strategies.” They attempt to achieve two main functions: generalizing from the cu...

In the most common formulation of the binary hypothesis distributed detection problem, local detectors collect statistically independent and identically distributed observations under each hypothesis. Based upon these data, each detector independently decides which hypothesis it judges to be true and then transmits its decision to a fusion center. The fusion center in turn makes a final global ...