We propose a new Walrasian tâtonnement process called a double-track procedure for efficiently allocating multiple heterogeneous indivisible items in two distinct sets to many buyers who view items in the same set as substitutes but items across the two sets as complements. In each round of the process, a Walrasian auctioneer first announces the current prices for all items, buyers respond by reporting their demands at these prices, and then the auctioneer adjusts simultaneously the prices of items in one set upward but those of items in the other set downward. It is shown that this procedure converges globally to a Walrasian equilibrium in finitely many rounds.

In many credit risk and pricing applications, credit transition matrix is modeled by a constant transition probability or generator matrix for Markov processes. Based on empirical evidence, we model rating transition processes as piecewise homogeneous Markov chains with unobserved structural breaks. The proposed model provides explicit formulas for the posterior distribution of the time-varying rating transition generator matrices, the probability of structural break at each period and prediction of transition matrices in the presence of possible structural breaks. Estimating the model by credit rating history, we show that the structural break in rating transitions can be captured by the proposed model. We also show that structural breaks in rating dynamics are different for different industries. We then compare the prediction performance of the proposed and time-homogeneous Markov chain models.

This article proposes an efficient and incentive compatible dynamic auction for selling multiple complementary goods. The seller has reserve prices. The auctioneer announces a current price for every bundle of goods and a supply set of goods, every bidder responds with a set of goods demanded at these prices, and the auctioneer adjusts prices. We prove that even when bidders can exercise their market power strategically, this dynamic auction always induces them to bid truthfully, resulting in an efficient allocation, its supporting Walrasian equilibrium price for every bundle of goods, and a generalized Vickrey-Clarke-Groves payment for every bidder.

Studying job matching in a Kelso-Crawford framework, we consider arbitrary constraints imposed on sets of doctors that a hospital can hire. We characterize all constraints that preserve the substitutes condition (for all revenue functions that satisfy the substitutes condition), a critical condition on hospitals’ revenue functions for well-behaved competitive equilibria. A constraint preserves the substitutes condition if and only if it is a “generalized interval constraint,” which specifies the minimum and maximum numbers of hired doctors, forces some hires, and forbids others. Additionally, “generalized polyhedral constraints” are precisely those that preserve the substitutes condition for all “group separable” revenue functions. (JEL C78, D47, I11, J23, J41, J44)