We introduce Bayesian Coalitional Games1 (BCGs), a generalization of classical coalitional games to settings with uncertainties. We define the semantics of BCG using the partition...
Over the past half decade, we have been exploring the use of logic in the specification and analysis of computational economic mechanisms. We believe that this approach has the p...
Developers using statically typed languages such as C and Java are increasingly having to interoperate with APIs and object models defined in dynamic languages. This impedance mis...
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...