We propose a smooth multibidding mechanism for environments where a group of agents have to choose one out of several projects. Our proposal is related to the multibidding mechanism (Pérez-Castrillo and Wettstein, 2002) but it is “smoother” in the sense that small variations in an agentʼs...

We analyze the problem of optimal monopoly pricing in social networks where agents care about consumption or prices of their neighbors. We characterize the relation between optimal prices and consumersʼ centrality in the social network. This relation depends on the market structure (monopoly...

We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n−1 blocks. It turns out that this bound is optimal in the sense there are TU-games for which the number of blocks required to access the core is exactly n−1.