A stable government is by definition not dominated by any other government. However, it may happen that all governments are dominated. In graph-theoretic terms this means that the dominance graph does not possess a source. In this paper we are able to deal with this case by a clever combination...

Given a simple game, a power configuration specifies the power of each player in each winning coalition. We introduce a new power configuration which takes into account bargaining among players in coalitions. We show that under very weak conditions on a bargaining solution there is a power...

We consider a model of the “world" with several regions that may create a unified entity or be partitioned into several unions (countries). The regions have distinct preferences over policies chosen in the country to which they belong and equally share the cost of public policies. It is known...

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 (anti-) coordination problems in networks in a laboratory experiment. Partici- pants interact with their neighbours in a fixed network to play a bilateral (anti-) coordination game. Our main treatment variable is the extent to which players are heterogeneous in the number of connections...

An experimental approach is used to examine the performance of three different multi-unit auction designs: discriminatory, uniform-price with fixed supply, and uniform-price with endogenous supply. We find that the strategies of the individual bidders and the aggregate demand curves are...

Transport is the sector with the fastest growth of greenhouse gases emissions, both in developed and in developing countries, leading to adverse climate change impacts. As the experts disagree on the occurrence of these impacts, by applying the analytic hierarchy process (AHP), we have faced the...

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.

We study dynamic multilateral markets, in which players’ payoffs result from coalitional bargaining. In this setting, we establish payoff uniqueness of the stationary equilibria when players exhibit some degree of impatience. We focus on market games with different player types, and derive...

This paper extends the theory of endogenous coalition formation, with complete information and transferable utility, to the overlapping case. We propose a cover function bargaining game which allows the formation of overlapping coalitions at equilibrium. We show the existence of subgame perfect...