This volume constitutes the thoroughly refereed post-proceedings of the International Workshop of the TYPES Working Group, TYPES 2000, held in Durham, UK in December 2000. The 15 revised full papers presented were carefully reviewed and selected during two rounds of refereeing and revision. They address significant issues on type theory and type systems and their applications to programming, systems design and proof theory.

The monograph gives a theoretical explanation of observed cooperative behavior in common pool situations. The incentives for cooperative decision making are investigated by means of a cooperative game theoretical framework. In a first step core existence results are worked out. Whereas general core existence results provide us with an answer for mutual cooperation, nothing can be said how strong these incentives and how stable these cooperative agreements are. To clarify these questions the convexity property for common pool TU-games in scrutinized in a second step. It is proved that the...

Since the 1980s, software agents and multi-agent systems have grown into what is now one of the most active areas of research and development activity in computing generally. One of the most important reasons for the current intensity of interest in the agent-based computing paradigm certainly is that the concept of an agent as an autonomous system, capable of interacting with other agents in order to satisfy its design objectives, is a natural one for software designers. This recognition has led to the growth of interest in agents as a new paradigm for software engineering.
This book...

This text constitutes the refereed proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, held in Antibes - Juan les Pins, France, in March 2002. The 50 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 209 submissions. The book offers topical sections on algorithms, current challenges, computational and structural complexity, automata and formal languages, and logic in computer science.

This present book provides an alternative approach to study the pre-kernel solution of transferable utility games based on a generalized conjugation theory from convex analysis. Although the pre-kernel solution possesses an appealing axiomatic foundation that lets one consider this solution concept as a standard of fairness, the pre-kernel and its related solutions are regarded as obscure and too technically complex to be treated as a real alternative to the Shapley value. Comprehensible and efficient computability is widely regarded as a desirable feature to qualify a solution concept apart...

This book provides an alternative approach to study the pre-kernel solution of transferable utility games based on a generalized conjugation theory from convex analysis.