We develop a model of assignment games with pairwise-identitydependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

We introduce a new matching model to mimic two-sided exchange programs such as tuition and worker exchange, in which each firm has to avoid being a net-exporter of workers. These exchanges use decentralized markets, making it difficult to achieve a balance between exports and imports. We show...

We develop a theory of stability in many-to-many matching markets. We give conditions under which the setwise-stable set, a core-like concept, is nonempty and can be approached through an algorithm. The usual core may be empty. The setwise-stable set coincides with the pairwise-stable set and...

This paper studies a stability notion and matching processes in the job market with incomplete information on the workers' side. Each worker is associated with a type, and each firm cares about the type of her employee under a match. Moreover, firms' information structure is described by...

I study a many-to-many, two-sided, transferable utility matching game. Consider data on matches or relationships between agents but not on the choice set of each agent. I investigate what economic parameters can be learned from data on equilibrium matches and agent characteristics. Features of a...

The thesis of this paper is mathematical formulation of the laws of Economics with application of the principle of Least Action of classical mechanics. This paper is proposed as the rigorous mathematical approach to Economics provided by the fundamental principle of the physical science – the...

This paper studies how external incentives can help agents to coordinate in summary-statistic games. Agents follow a myopic best-reply rule and face a trade-off between efficiency and strategic uncertainty. A principal can help agents to coordinate on the Pareto optimal equilibrium by monitoring...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. It turns out that the first-order approach is not innocuous. For example, in...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...