We propose a new, easy-to-implement, class of payment rules, "Reference Rules", to make core-selecting package auctions more robust.  Small, almost-riskless, profitable deviations from "truthful bidding" are often easy for bidders to find under currently-used payment rules.  Reference Rules...

We generalize the class of apex game by combining a winning coalition of symmetric minor players with a collection of apex sets which can form winning coalitions only together with a fixed quota of minor players.  By applying power indices to these games and their subgames we generate players'...

We study evolutionary dynamics in assignment games where many agents interact anonymously at virtually no cost.  The process is decentralized, very little information is available and trade takes place at many different prices simultaneously.  We propose a completely uncoupled learning process...

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

This note introduces transferable utility cooperative games with multiple membership, extending the scope of cooperative game theory to economic environments featuring externalities and membership in multiple coalitions.  This wider class of games generalises games in characteristic and...