Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Game Theory, Alive
  • Language: en
  • Pages: 400

Game Theory, Alive

We live in a highly connected world with multiple self-interested agents interacting and myriad opportunities for conflict and cooperation. The goal of game theory is to understand these opportunities. This book presents a rigorous introduction to the mathematics of game theory without losing sight of the joy of the subject. This is done by focusing on theoretical highlights (e.g., at least six Nobel Prize winning results are developed from scratch) and by presenting exciting connections of game theory to other fields such as computer science (algorithmic game theory), economics (auctions and matching markets), social choice (voting theory), biology (signaling and evolutionary stability), an...

Twenty Lectures on Algorithmic Game Theory
  • Language: en
  • Pages: 357

Twenty Lectures on Algorithmic Game Theory

Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

Discrete Probability and Algorithms
  • Language: en
  • Pages: 169

Discrete Probability and Algorithms

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.

Online Algorithms
  • Language: en
  • Pages: 436

Online Algorithms

  • Type: Book
  • -
  • Published: 1998-08-12
  • -
  • Publisher: Springer

This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996. An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work. The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.

Web Intelligence: Research and Development
  • Language: en
  • Pages: 631

Web Intelligence: Research and Development

  • Type: Book
  • -
  • Published: 2003-06-30
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the First Asia-Pacific Conference on Web Intelligence, WI 2001, held in Maebashi City, Japan, in October 2001.The 28 revised full papers and 45 revised short papers presented were carefully reviewed and selected from 153 full-length paper submissions. Also included are an introductory survey and six invited presentations. The book offers topical sections on Web information systems environments and foundations, Web human-media engineering, Web information management, Web information retrieval, Web agents, Web mining and farming, and Web-based applications.

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
  • Language: en
  • Pages: 608

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

  • Type: Book
  • -
  • Published: 1996-01-01
  • -
  • Publisher: SIAM

This text covers the proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, which was held in Atlanta, Georgia, in January 1996.

Algorithm Engineering
  • Language: en
  • Pages: 209

Algorithm Engineering

  • Type: Book
  • -
  • Published: 2003-06-30
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations.

Proceedings 2002 VLDB Conference
  • Language: en
  • Pages: 1145

Proceedings 2002 VLDB Conference

  • Type: Book
  • -
  • Published: 2002-12-11
  • -
  • Publisher: Elsevier

Proceedings of the 28th Annual International Conference on Very Large Data Bases held in Hong Kong, China on August 20-23, 2002. Organized by the VLDB Endowment, VLDB is the premier international conference on database technology.

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
  • Language: en
  • Pages: 314

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

  • Type: Book
  • -
  • Published: 2003-05-15
  • -
  • Publisher: Springer

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

Algorithm Engineering
  • Language: en
  • Pages: 209

Algorithm Engineering

Compact DFA representation for fast regular expression search / Gonzalo Navarro / - The Max-Shift algorithm for approximate string matching / Costas S. Iliopoulos / - Fractal matrix multiplication : a case study on portability of cache performance / Gianfranco Bilardi / - Experiences with the design and implementation of space-efficient deques / Jyrki Katajainen / - Designing and implementing a general purpose halfedge data structure / Hervé Brönnimann / - Optimised predecessor data structures for internal memory / Naila Rahman / - An adaptable and expensible geometry kernel / Susan Hert / - Efficient resource allocation with noisy functions / Arne Andersson / - Improving the efficiency of branch and bound algorithms for the simple plant location problem / Boris Goldengorin / - Exploiting partial knowledge of satisfying assignments / Kazuo Iwama / - Using PRAM algorithms on a uniform-memory-access shared-memory architecture / David A. Bader / - An experimental study of basic communicat ...