A basic theorem in n-person game theory due to Scarf states that a balanced game has a nonempty core. Scarf's proof presents a procedure to find a point in the core of a discrete game, where every coalition disposes of a finite number of alternatives. The proof for a general game follows by...

This paper concerns an application to the Belgian economy of general equilibrium analysis in the presence of downward real wage rigidities. The model aims at explaining the short-run impact of recent income and exchange policies upon employment in Belgium. Mathematical programming techniques are...

Herbert Scarf has recently introduced an algorithm for integer programs based on the concept of primitive sets. We show that as the choice variables become continuous, this algorithm converges to a dual simplex algorithm. This result is robust in the sense that even before the limit is reached,...

In this paper we approach the concept of logrolling by examining a voting system where choices are made among sets of competing projects as a game in characteristic function form. We translate the question: "Will there be prices for votes on different projects which clear the market?" into a...

In an earlier paper we presented a variable dimension algorithm for solving the linear complementarity problem (LCP). We now extend the class of LCP's that can be solved by this algorithm to include LCP's with copositive plus coefficient matrices. The extension, inspired by Lemke [1965], is...