We analyze the formation of partnerships in social networks. Players need favors at random times and ask their neighbors in the network to form exclusive long-term partnerships that guarantee reciprocal favor exchange. Refusing to provide a favor results in the automatic removal of the...

We investigate how information goods are priced and diffused over links in a network. A new equivalence relation between nodes captures the effects of network architecture and locations of sellers on the division of profits, and characterizes the topology of competing (and potentially...

We establish that the fraction of preference profiles for which the random serial dictatorship allocation is ordinally efficient vanishes for allocation problems with many object types. We consider also a probabilistic setting where in expectation agents have moderately similar preferences...

We study a double auction environment where buyers and sellers have interdependent valuations and multi-unit demand and supply. We propose a new mechanism that satisfies ex post incentive compatibility, individual rationality, feasibility, nonwastefulness, and no budget deficit. Moreover, this...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...