This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...
Abstract. A framework, PISA, for conducting dialogues to resolve disputes concerning the correct categorisation of particular cases, is described. Unlike previous systems to conduc...
Maya Wardeh, Trevor J. M. Bench-Capon, Frans Coene...
Multi-agent systems are an attractive approach to modeling systems of interacting entities, but in some cases mathematical models of these systems can offer complementary benefits...
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...