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

In this paper we consider the Minimum Cost Spanning Tree model. We assume that a central planner aims at implementing the minimum cost spanning tree not knowing the true link costs. The central planner sets up a game where agents announce the link costs, a tree is chosen and costs are allocated...

In this paper we consider the minimum cost spanning tree model. We assume that a central planner aims at implementing a minimum cost spanning tree not knowing the true link costs. The central planner sets up a game where agents announce link costs, a tree is chosen and costs are allocated...