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 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 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...

Consider repeated two-player games with perfect monitoring and discounting. We provide an algorithm that computes the set V* of payoff pairs of all pure-strategy subgame perfect equilibria with public randomization. The algorithm provides significant efficiency gains over the existing...

A two-person infinite-horizon bargaining model where one of the players may have either of two discount factors, has a multiplicity of perfect Bayesian equilibria. Introducing the slightest possibility that either player may be one of a rich variety of stationary behavioral types singles out a...

Consider repeated two-player games with perfect monitoring and discounting. We provide an algorithm that computes the set V* of payoff pairs of all pure-strategy subgame perfect equilibria with public randomization. The algorithm provides significant efficiency gains over the existing...

A two-person infinite-horizon bargaining model where one of the players may have either of two discount factors, has a multiplicity of perfect Bayesian equilibria. Introducing the slightest possibility that either player may be one of a rich variety of stationary behavioral types singles out a...