We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

The relevance of bargaining to everyday life can easily be ascertained, yet the study of any bargaining process is extremely hard, involving a multiplicity of questions and complex issues. The objective of this paper is to provide new insights on some dimensions of the bargaining process -...

We show that the core of each strongly size monotonic hedonic game is not empty and is externally stable. This is in sharp contrast to other sufficient conditions for core non-emptiness which do not even guarantee the existence of a stable set in such games

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical...

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von...

This paper first establishes a new core theorem using the concept of generated payoffs: the TU (transferable utility) core is empty if and only if the maximum of generated payoffs (mgp) is greater than the grand coalition's payoff v(N), or if and only if it is irrational to split v(N). It then...

We consider a two-stage public goods provision game: In the first stage, players simultaneously decide if they will join a contribution group or not. In the second stage, players in the contribution group simultaneously offer contribution schemes in order to influence the government's choice on...

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 introduce a new solution concept for models of coalition formation, called the myopic stable set. The myopic stable set is defined for a very general class of social environments and allows for an infinite state space. We show that the myopic stable set exists and is non-empty. Under minor...