The problem of computing the strategy to commit to has been widely investigated in the scientific literature for the case where a single follower is present. In the multi-follower setting though, results are only sporadic. In this paper, we address the multi-follower case for normal-form games, assuming that, after observing the leader’s commitment, the followers play pure strategies and reach ...

Estimation of the mode of a distribution over n from discrete samples is introduced and three methods for its solution are developed and evaluated. The first solution is based on Fréchet’s definition of central tendencies. We show that algorithms based on this approach have only limited success due to the non-differentiability of the Fréchet measures. The second solution is based on tracking ma...

The workshop's website raises the interesting question of whether the original "No Silver Bullet" article [2] was optimistic, pessimistic, or sadly, realistic. This position paper follows the direction presented in David Harel's paper [3]: although we agree with many of its individual points, the paper present a far gloomier assessment of the situation than seems appropriate. In other words, we...

We present a family of epidemic algorithms for maintaining replicated database systems. The algorithms are based on the causal delivery of log records where each record corresponds to one transaction instead of one operation. The first algorithm in this family is a pessimistic protocol that ensures serializability and guarantees strict executions. Since we expect the epidemic algorithms to be u...