We consider a connection networks model. Every agent has a demand in the form of pairs of locations she wants connected, and a willingness to pay for connectivity. A planner aims at implementing a welfare maximizing network and allocating the resulting cost, but information is asymmetric: agents...

We introduce a reciprocity protocol, an innovative approach to coordinating and sharing rewards in blockchains. Inherently decentralized and easy to implement, it puts emphasis on incentives rather than forcing specific sharing rules from the outset. Analyzing the non-cooperative game the...

We study the optimal management of evolving hierarchies, which abound in real-life phenomena. An initiator invests into finding a subordinate, who will bring revenues to the joint venture and who will invest herself into finding another subordinate, and so on. The higher the individual...

We introduce a description of the power structure which is inherent in a strategic game form using the concept of an interaction sheaf. The latter assigns to each open set of outcomes a set of interaction arrays, specifying the changes that coalitions can make if outcome belongs to this open...

The concept of coalition proof Nash equilibrium was introduced by Bernheim, Peleg, and Whinston [1987]. In the present paper, we consider the representation problem for coalition proof Nash equilibrium: For a given effectivity function, describing the power structure or the system of rights of...