AMS classifications: 47H10; 54H25; 55M20; 90C33; 91B50

An auctioneer wishes to sell several heterogeneous indivisible items to a group of potential bidders. Each bidder has valuations over the items but faces a budget constraint and may therefore not be able to pay up to his valuations. In such markets, a competitive equilibrium typically fails to...

Random matching models with different states are an important class of dynamic games; for example, money search models, job search models, and some games in biology are special cases.In this paper, we investigate the basic structure of the models: the existence of equilibria, the global...

We study transferable utility games with limited cooperation between the agents. The focus is on communication structures where the set of agents forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph. Agents are...

A general equilibrium model is considered with multiple divisible and multiple indivisible commodities.In models with indivisibles it is always assumed that an indivisible commodity, called money, is present that is used to transfer the value of certain amounts of indivisible goods.For these...

Mathematics Subject Classification 2000: 91A12, 91A43

This paper analyzes the problem of selling a number of indivisible items to a set of unitdemand bidders. An ascending auction mechanism called the Excess Demand Ascending Auction (EDAA) is defined. The main results demonstrate that EDAA terminates in a finite number of iterations and that the...

On the class of cycle-free directed graph games with transferable utility solution concepts, called web values, are introduced axiomatically, each one with respect to some specific choice of a management team of the graph. We provide their explicit formula representation and simple recursive...