There is interest in designing simultaneous auctions for situations such as the recent FCC radio spectrum auctions, in which the value of assets to a bidder depends on which other assets he or she wins. In such auctions, bidders may wish to submit bids for combinations of assets. When this is...

We consider the Capacitated Economic Lot Size Problem with piecewise linear production costs and general holding costs, which is an NP-hard problem but solvable in pseudo-polynomial time. A straightforward dynamic programming approach to this problem results in an O(n ² c\bar d\bar ) algorithm,...

We show that predicting the HPP or FHP III lattice gas for finite time is equivalent to calculating the output of an arbitrary Boolean circuit, and is therefore P-complete: that is, it is just as hard as any other problem solvable by a serial computer in polynomial time. <p> It is widely believed...</p>

We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These are equivalent, for a restricted set of initial conditions, to non-zero probability transitions in single spin-flip dynamics of the Ising model at zero temperature. <p> We...</p>

The theory of computation and automata has occasionally aroused some interest among political scientists. The article outlines some early applications, although the main emphasis is on the most recent ones. We concentrate on the applications to bargaining and negotiation procedures. It is argued...

From personal interest and also on behalf of the Mathematical Programming Society I have been trying to keep afloat in the flood of writing that followed Khachian's "Polynomial Time Algorithm for Linear Programming" (Khachian, L. G. 1979. A polynomial algorithm in linear programming. Dokl. Akad....

The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst-case approach to the analysis of heuristic performance. A worst-case study establishes the...

In one of the most influential existence theorems in mathematics, John F. Nash proved in 1950 that any normal form game has an equilibrium. More than five decades later, it was shown that the computational task of finding such an equilibrium is intractable, that is, unlikely to be carried out...