Operations, Information and Decisions Papers

Document Type

Book

Date of this Version

2004

Publication Source

Encyclopaedia of Mathematical Sciences

Volume

110

Start Page

1

Last Page

72

DOI

10.1007/978-3-662-09444-0_1

Abstract

This survey describes a general approach to a class of problems that arise in combinatorial probability and combinatorial optimization. Formally, the method is part of weak convergence theory, but in concrete problems the method has a flavor of its own. A characteristic element of the method is that it often calls for one to introduce a new, infinite, probabilistic object whose local properties inform us about the limiting properties of a sequence of finite problems.

Copyright/Permission Statement

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-09444-0_1

Share

COinS
 

Date Posted: 27 November 2017