A randomised approximation scheme for the permanent of a 0-1 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph;â€¦ (More)

In the area of statistical physics, Monte Carlo algorithms based on Markov chain simulation have been in use for many years. The validity of these algorithms depends crucially on the rate ofâ€¦ (More)

In recent years, Markov chain simulation has emerged as a powerful algorithmic paradigm. Its chief application is to the random sampling of combinatorial structures from a specified probabilityâ€¦ (More)

Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose running time is a random variable. We consider the problem ofâ€¦ (More)

We study the ability of decentralized, local dynamics in non-cooperative games to rapidly reach an approximate Nash equilibrium. For symmetric congestion games in which the edge delays satisfy aâ€¦ (More)

We present a polynomial-time randomized algorithm for estimating the permanent of an arbitrary n Ã— n matrix with nonnegative entries. This algorithm---technically a "fully-polynomial randomizedâ€¦ (More)