This paper analyzes the computational complexity involved in solving fairness issues on graphs, e.g.in the installation of networks such as water networks or oil pipelines. Based on individual rankings of the edges of a graph, we will show under which conditions solutions, i.e.spanning trees, can be determined efficiently given the goal of maximin voter satisfaction. In particular, we show that computing spanning trees for maximin voter satisfaction under voting rules such as approval voting or the Borda count is NP-hard for a variable number of voters while it remains polynomially solvable for a constant number of voters.

Publication of the Handbook of Group Decision and Negotiation marks a milestone in the evolution of the group decision and negotiation (GDN) eld. On this occasion, editors Colin Eden and Marc Kilgour asked me to write a brief history of the eld to provide background and context for the volume. They said that I am in a good position to do so: Actively involved in creating the GDN Section and serving as its chair; founding and leading the GDN journal, Group Decision and Negotiation as editor-in-chief, and the book series, “Advances in Group Decision and Negotiation” as editor; and serving as general chair of the GDN annual meetings. I accepted their invitation to write a brief history. In 1989 what is now the Institute for Operations Research and the Management Sciences (INFORMS) established its Section on Group Decision and Negotiation. The journal Group Decision and Negotiation was founded in 1992, published by Springer in cooperation with INFORMS and the GDN Section. In 2003, as an ext- sion of the journal, the Springer book series, “Advances in Group Decision and Negotiation” was inaugurated.

This volume contains the papers presented at ADT 2009, the first International Conference on Algorithmic Decision Theory. The conference was held in San Servolo, a small island of the Venice lagoon, during October 20-23, 2009. The program of the conference included oral presentations, posters, invited talks, and tutorials. The conference received 65 submissions of which 39 papers were accepted (9 papers were posters). The topics of these papers range from computational social choice preference modeling, from uncertainty to preference learning, from multi-criteria decision making to game theory.

The rapidly growing field of computational social choice, at the intersection of computer science and economics, deals with the computational aspects of collective decision making. This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively. Chapters devoted to each of the field's major themes offer detailed introductions. Topics include voting theory (such as the computational complexity of winner determination and manipulation in elections), fair allocation (such as algorithms for dividing divisible and indivisible goods), coalition formation (such as matching and hedonic games), and many more. Graduate students, researchers, and professionals in computer science, economics, mathematics, political science, and philosophy will benefit from this accessible and self-contained book.

This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.

A very active field of research is emerging at the frontier of statistical physics, theoretical computer science/discrete mathematics, and coding/information theory. This book sets up a common language and pool of concepts, accessible to students and researchers from each of these fields.

Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together research in the field, encompassing work on percolation, isoperimetric inequalities, eigenvalues, transition probabilities, and random walks. Written by two leading researchers, the text emphasizes intuition, while giving complete proofs and more than 850 exercises. Many recent developments, in which the authors have played a leading role, are discussed, including percolation on trees and Cayley graphs, uniform spanning forests, the mass-transport technique, and connections on random walks on graphs to embedding in Hilbert space. This state-of-the-art account of probability on networks will be indispensable for graduate students and researchers alike.