A simple protocol for coalition formation is presented. First, an order of the players is randomly chosen. Then, a coalition grows by sequentially incorporating new members in this order. The protocol is studied in the context of non-transferable utility (NTU) games in characteristic function...

A matrix A defines an assignment market, where each row represents a buyer and each column a seller. If buyer i is matched with seller j, the market produces aij units of utility. Quint (1991) points out that usually many different assignment matrices exist that define markets with the same core...

In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connecting all agents to the source and dividing the cost among them. The basic idea is very simple: we ask each agent the part of the cost he is willing to pay for an arc to be constructed. We prove...

We present a unified framework for a broad class of values in transferable utility games with coalition structure, including the Owen coalitional value and two weighted versions with weights given by the size of the coalitions. We provide three axiomatic characterizations using the properties of...