In two-sided and coalition matching games, agents must all agree for a match to be formed, and agents can make only a finite number of matches. I examine the nonparametric identification and estimation of match production functions in matching games with endogenous prices and transferable utility. Inequalities derived from necessary conditions for equilibrium underly a nonparametric maximum sco...

In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ranging from multi-agent coordination to group formation in social networks. However, the practical application of hedonic games is hindered by the fact that the naive representation for such games is exponential in th...

The type-agent core is a new solution concept for exchange economies with asymmetric information. It coincides with the set of subgame-perfect equilibrium outcomes of a simple competitive screening game. Uninformed intermediaries help the agents to cooperate in an attempt to make some profit. The paper extends the work of Perez-Castrillo [Cooperative outcomes through non-cooperative games, Game...

We propose a new solution concept to address the problem of sharing a surplus among the agents generating it. The sharing problem is formulated in the preferences-endowments space. The solution is defined in a recursive manner incorporating notions of consistency and fairness and relying on properties satisfied by the Shapley value for Transferable Utility (TU) games. We show a solution exists,...

In the framework of (set-valued or single-valued) solutions for coalitional games with transferable utility, the three notions of consistency, bilateral consistency, and converse consistency are frequently used to provide axiomatic characterizations of a particular solution (like the core, prekernel, prenucleolus, Shapley value, and EANSC-value). Our main equivalence theorem claims that a solut...

A solution function for convex transferable utility games encourages the grand coalition if no player prefers (in a precise sense defined in the text) any coalition to the grand coalition. We show that the Shapley value encourages the grand coalition in all convex games and the τ -value encourages the grand coalitions in convex games up to three (but not more than three) players. Solution funct...

We propose two flexible game models to represent and analyze cases that cannot be modeled by current game models. One is called sharing creditability game (SCG) and the other is called bottomline game (BLG). The new models transform cooperative games into new games that incorporate auxiliary information (noncooperative in nature) usually neglected in previous theories. The new games will be sol...

We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of each coalition is determined by the safety level payoff it derives in the original—non-cooperative—game. We thus capture several key features of agents’ behavior: (i) the possible monetary transfer among the coalition members; ...