Silicon Valley visionary Jaron Lanier was among the first to predict the revolutionary changes the World Wide Web would bring to commerce and culture. Now, in his first book, Lanier offers this cautionary look at the way the Web is transforming our lives, for better and for worse. The current design and function of the web have become so familiar that it is easy to forget that they grew out of programming decisions made decades ago. The web's first designers made crucial choices with enormous-and often unintended-consequences. What's more, these designs quickly became "locked in," a permanent part of the web's very structure. Lanier warns that our financial markets and sites like Wikipedia, Facebook, and Twitter are elevating the "wisdom" of mobs and computer algorithms over the intelligence and judgment of individuals. This book is a deeply felt defense of the individual, from an author uniquely qualified to comment on the way technology interacts with our culture.--From publisher description.

"The media theorist who gave us the concepts of viral media, social currency and screenagers is back with his most far-reaching appraisal yet of digital media" --Cover, p. 4.

The starting point of this volume was a conference entitled "Progress in Mathematical Programming," held at the Asilomar Conference Center in Pacific Grove, California, March 1-4, 1987. The main topic of the conference was developments in the theory and practice of linear programming since Karmarkar's algorithm. There were thirty presentations and approximately fifty people attended. Presentations included new algorithms, new analyses of algorithms, reports on computational experience, and some other topics related to the practice of mathematical programming. Interestingly, most of the progress reported at the conference was on the theoretical side. Several new polynomial algorithms for linear program- ming were presented (Barnes-Chopra-Jensen, Goldfarb-Mehrotra, Gonzaga, Kojima-Mizuno-Yoshise, Renegar, Todd, Vaidya, and Ye). Other algorithms presented were by Betke-Gritzmann, Blum, Gill-Murray-Saunders-Wright, Nazareth, Vial, and Zikan-Cottle. Efforts in the theoretical analysis of algo- rithms were also reported (Anstreicher, Bayer-Lagarias, Imai, Lagarias, Megiddo-Shub, Lagarias, Smale, and Vanderbei). Computational experiences were reported by Lustig, Tomlin, Todd, Tone, Ye, and Zikan-Cottle. Of special interest, although not in the main direction discussed at the conference, was the report by Rinaldi on the practical solution of some large traveling salesman problems. At the time of the conference, it was still not clear whether the new algorithms developed since Karmarkar's algorithm would replace the simplex method in practice. Alan Hoffman presented results on conditions under which linear programming problems can be solved by greedy algorithms.