We consider the multi-period pricing problem of a service firm facing time-varying capacity levels. Customers are assumed to be fully strategic with respect to their purchasing decisions, and heterogeneous with respect to their valuations, and arrival-departure periods. The firm's objective is...

We consider a one-sided assignment market or exchange network with transferable utility and the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of ‘offers’ based on estimated best alternative matches, in the spirit of pairwise Nash...

The Folk Theorem for repeated games suggests that finding Nash equilibria in repeated games should be easier than in one-shot games. In contrast, we show that the problem of finding any Nash equilibrium for a three-player infinitely-repeated game is as hard as it is in two-player one-shot games....