Foundations for iterated admissibility (i.e., the iterated removal of weakly dominated strategies) need to confront a fundamental challenge. On the one hand, admissibility requires that a player consider every strategy of their opponents possible. On the other hand, reasoning that the opponents are rational requires ruling out certain strategies. Brandenburger, Friedenberg and Keisler’s (BFK, E...

We introduce and study the main properties of a class convex risk measures that refine Expected Shortfall by simultaneously controlling expected losses associated with different portions tail distribution. The corresponding adjusted Shortfalls quantify as minimum amount capital has to be raised injected into financial position X ensure ES p ( ) does not exceed pre-specified threshold g for ever...

In the study of distributed systems, the assumption-commitment framework is crucial for compositional speciication of processes. The idea is that we reason about each process separately, making suitable assumptions about other processes in the system. Symmetrically, each process commits to certain actions which the other processes can rely on. We study such a framework from an automata-theoreti...

Recently, argument labellings have been proposed as a new (equivalent) way to express the extension semantics of Abstract Argumentation (AA) frameworks. Here, we introduce a labelling approach for the complete semantics in Assumption-Based Argumentation (ABA), where labels are assigned to assumptions rather than whole arguments. We prove that the complete assumption labelling corresponds to the...

This chapter is concerned with the impact of traffic correlations on the end-to-end delay of packets in a chain of IP routers represented by an open tandem queueing system. Particular consideration is given to Kleinrock’s independence assumption on the performance impact of traffic correlation on packet switched networks with Poisson arrival processes and exponential packet length distributions...

Hash Tables A hash table is a data structure with the following operations: • INSERT(k, v): insert an item with key k and value v • SEARCH(k): searches the hash table for key k • DELETE(k): deletes key k from the hash table Goal is to have each of these operations in O(1) time. You can think of a hash table as a list of m slots. Inserting a key puts it in one of the slots in the hash table, del...

Formal argumentation based dialogue models have attracted some research interests recently. Within this line of research, we propose a formal model for argumentation-based dialogues between agents, using assumption-based argumentation (ABA). Thus, the dialogues amount to conducting an argumentation process in ABA. The model is given in terms of ABA-specific utterances, debate trees and forests ...