Berthold Vöcking Libri

Algorithms dictate how computers process information and perform tasks, underpinning many technological advancements across various fields such as science, medicine, logistics, and entertainment. Efficient algorithms empower personal computers to run cutting-edge games and have been crucial in scientific breakthroughs, including the rapid sequencing of the human genome, made possible by innovative algorithmic concepts. The most significant advancements in algorithms stem from creative approaches to computational problems, which often extend beyond mere arithmetic to intriguing challenges like navigating mazes, partitioning treasure maps, or optimizing travel plans. Addressing these complex issues demands logical reasoning, geometric and combinatorial creativity, and a flair for innovation, all essential for designing and analyzing algorithms. This book features 41 articles that explore some of the most captivating algorithmic ideas, presented in an accessible, nontechnical style. Originating from a collaborative effort among German-language universities, the content aims to inspire high-school students about the allure of algorithms and computer science. It requires no prior knowledge of the subject, making it an engaging and enlightening read for both students and curious adults.

This book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013. The 25 papers presented in this volume were carefully reviewed and selected from 65 submissions. They cover various important aspects of algorithmic game theory, such as solution concepts in game theory, efficiency of equilibria and the price of anarchy, computational aspects of equilibria and game theoretical measures, repeated games and convergence of dynamics, evolution and learning in games, coordination and collective action, network games and graph-theoretic aspects of social networks, voting and social choice, as well as algorithmic mechanism design.

Hinter vielen Computer-Programmen stecken intelligente Verfahren, die man als Algorithmen bezeichnet. Algorithmen lösen nicht nur mathematische Zahlen-Aufgaben, sondern auch ganz alltägliche Probleme: Wie ermittle ich den kürzesten Weg zwischen zwei Orten? Oder, wie kann ich einen Kuchen gerecht aufteilen? In diesem Buch erklären Informatiker 43 besonders elegante Algorithmen und illustrieren die Grundprinzipien des Algorithmendesigns anhand von interessanten Anwendungen, ohne dabei vom Leser spezielle Vorkenntnisse zu erwarten.