This book may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations.

The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications.

This book of introduction to combinatorics is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.

This book collects recent research papers in game theory, which come from diverse scientific communities all across the world.

This book covers many of the hottest area of useful new game theory research, introducing deep new problems, techniques, etc.

This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics.

This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.

The aim of this book is to present a unified treatment of some of the major fields of applications of combinatorics.

This book deals with combinatorial games, that is, games not involving chance or hidden information.

This fascinating collection of articles by some of the top names in the field is a state-of-the-art look at combinatorial games.

This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games such as Go and Hex, on impartial games such as Chomp and Wythoff's Nim, etc.

On one level, this is a collection of subroutines, in FORTRAN, for the solution of combinatorial problems.

This book covers fundamental, theoretical topics as well as advanced, practical applications of Greedy Algorithms.

This comprehensive introduction to a burgeoning field is written from a computer science perspective, while bringing together ideas from operations research, game theory, economics, logic, and even philosophy and linguistics.

It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.

The text fully develops an algorithmic approach to Knapsack Problems without losing mathematical rigor.

At the time of Nash's early work, game theory was briefly popular among some mathematicians and Cold War analysts.

Striking an appropriate balance of mathematical and analytical rigor, this book teaches game theory by examples.

This book gives the reader access to the mathematical techniques involved and goes on to apply fixed point theorems to proving the existence of equilibria for economics and for co-operative and noncooperative games.

This is the previous page of Combinatorics and Game Theory, we are in the processing to convert all the books there to the new page. Please check this page daily!!!