We develop a model of assignment games with pairwise-identity-dependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

On the domain of two-sided assignment markets, the nucleolus is axiomatized as the unique solution that satisfies derived consistency (Owen, 1992) and complaint mono- tonicity on sectors size. As a consequence, we obtain a geometric characterization of the nucleolus by means of a strong form of...

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...

We study decentralized learning dynamics for the classic assignment game with transferable utility.  At random points in time firms and workers match, break up, and re-match in the sesarch for better opportunities.  We propose a simple learning process in which players have no knowledge about...

Abstract: We present a unifying framework for transferable utility coalitional games that are derived from a non-negative matrix in which every entry represents the value obtained by combining the corresponding row and column. We assume that every row and every column is associated with a...

Abstract: We consider price-fee competition in bilateral oligopolies with perfectly-divisible goods, non-expandable infrastructures, concentrated agents on both sides, and constant marginal costs. We define and characterize stable market outcomes. Buyers exclusively trade with the supplier with...

We present sufficient conditions for monotone matching in environments where utility is not fully transferable between partners. These conditions involve complementarity in types not only of the total payoff to a match, as in the transferable utility case, but also in the degree of...

An assignment situation can be considered as a two-sided market consisting of two disjoint sets of objects.A non-negative reward matrix describes the profit if an object of one group is assigned to an object of the other group. Assuming that each object is owned by a different agent, Shapley and...

Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbour games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...

Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, neighbour games are as well assignment games as line graph restricted games. We will show that the intersection of the class of...