This textbook connects three vibrant areas at the interface between economics and computer science: algorithmic game theory, computational social choice, and fair division. It thus offers an interdisciplinary treatment of collective decision making from an economic and computational perspective. Part I introduces to algorithmic game theory, focusing on both noncooperative and cooperative game theory. Part II introduces to computational social choice, focusing on both preference aggregation (voting) and judgment aggregation. Part III introduces to fair division, focusing on the division of both a single divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In all these parts, much weight is given to the algorithmic and complexity-theoretic aspects of problems arising in these areas, and the interconnections between the three parts are of central interest.

Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity'', a kind of symbiosis of these two areas.

This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.

Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity'', a kind of symbiosis of these two areas.

This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.

As its name suggests, the EHCI-DSVIS conference has been a special event, merging two different, although overlapping, research communities: EHCI (Engineering for Human-Computer Interaction) is a conference organized by the IFIP 2.7/13.4 working group, started in 1974 and held every three years since 1989. The group's activity is the scientific investigation of the relationships among the human factors in computing and software engineering. DSVIS (Design, Specification and Verification of Interactive Systems) is an annual conference started in 1994, and dedicated to the use of formal methods for the design of interactive systems. Of course these two research domains have a lot in common, and are informed by each other's results. The year 2004 was a good opportunity to bring closer these two research communities for an event, the 11th edition of DSVIS and the 9th edition of EHCI. EHCI-DSVIS was set up as a working conference bringing together researchers and practitioners interested in strengthening the scientific foundations of user interface design, specification and verification, and in examining the relationships between software engineering and human-computer interaction. The call for papers attracted a lot of attention, and we received a record number of submissions: out of the 65 submissions, 23 full papers were accepted, which gives an acceptance rate of approximately 34%. Three short papers were also included. The contributions were categorized in 8 chapters: Chapter 1 (Usability and Software Architecture) contains three contributions which advance the state of the art in usability approaches for modern software engineering.

This book constitutes thoroughly refereed and revised selected papers from the proceedings of 19th European Conference on Multi-Agent Systems, EUMAS 2022, held in Dusseldorf, Germany, during September 14-16, 2022. The 23 full papers included in this book were carefully reviewed and selected from 36 submissions. The book also contains 6 short summaries of talks from PhD students at the PhD day. The papers deal with current topics in the research and development of multi-agent systems.

This book constitutes the conference proceedings of the 5th International Conference on Algorithmic Decision Theory , ADT 2017, held in Luxembourg, in October 2017.The 22 full papers presented together with 6 short papers, 4 keynote abstracts, and 6 Doctoral Consortium papers, were carefully selected from 45 submissions. The papers are organized in topical sections on preferences and multi-criteria decision aiding; decision making and voting; game theory and decision theory; and allocation and matching.

Wahrend die Kryptologie Konzepte und Methoden aus der Komplexitatstheorie verwendet, ist die Forschung in der Komplexitatstheorie wiederum oft durch Fragen aus der Kryptologie motiviert. Der Band hebt die enge Verflechtung dieser beiden Gebiete hervor und fuhrt auf verstandlicher Weise in das faszinierende Gebiet der Kryptokomplexitat" ein. Das Buch enthalt zahlreiche Abbildungen und Ubungsaufgaben sowie ein ausfuhrliches Stichwort- und Literaturverzeichnis. Es eignet sich fur Studierende der Informatik, Mathematik oder Ingenieurswissenschaften."

Dieses Buch fuhrt in das junge, interdisziplinare Gebiet Computational Social Choice ein, das an der Schnittstelle zwischen der Informatik und den Politik- und Wirtschaftswissenschaften liegt. Ausgehend von der klassischen Spiel- und Social-Choice-Theorie werden die algorithmischen Eigenschaften von Spielen, Wahlen und Aufteilungsverfahren in leicht verstandlicher und dennoch exakter Form prasentiert.

Dieses Buch richtet sich an Studierende und Autodidakten, die sich gezielt die verschiedenen Themen rund um Computernetzwerke aneignen mochten. Es versteht sich als Erganzung zu einer Vorlesung. Da es eine Fulle von Aufgaben und Losungen bietet, kann es gezielt zur Prufungsvorbereitung genutzt werden. Thematisch wird der Bogen von niedrigen Kommunikationsschichten bis hin zu anwendungsorientierten Schichten gespannt. Quelldaten zu einem Teil der Aufgaben sind online verfugbar."