Public good games in coalitional form, such as the ones depicting international environmental agreements for the reduction of a global pollutant, generally foresee scarce levels of cooperation. The incentive to free ride, that increases for higher levels of cooperation, prevents the formation of...

We present and analyze a theory of cooperative bargaining under asymmetric information, based on the equity principles of the conditional random dictatorship—choosing with equal probability one of the individuals to act as a dictator under the participation constraint of the other players. Our...

This note revisits the impossibility result by Watanabe and Muto (2008), showing that almost all coalition structures cannot be at the core of patent licensing games. In contrast to their result, we demonstrate that if we only allow devia- tions under the exogenously fixed payment scheme and...

Interval games are an extension of cooperative coalitional games in which players are assumed to face payoff uncertainty as represented by a closed interval. In this study, we examine two interval-game versions of Shapley values (i.e., the interval Shapley value and the interval Shapley-like...

O'donoghue and Zweimüller (2004, J. of Econ. Growth), a seminal work, showed that broadening leading breadth in patent protection can stimulate innovation. However, the empirical literature has consistently found skeptical results on the positive effect. To fill the gap, we build another...

We consider decentralized one-to-one matching markets with myopic and farsighted agents. We study myopic-farsighted stable sets that are internally and externally stable when myopic agents only care about their immediate payoffs, while farsighted agents take into account further possible...

Several models of social preferences have been developed at the intersection of social psychology and behavioral economics, such as social value orientation (SVO) and conditional cooperation. Whereas SVO is well researched in its dispositional and situational correlates, we aim to locate...

Measuring individual productivity (or equivalently distributing the overall productivity) in a network structure of workers displaying peer effects has been a subject of ongoing interest in many areas ranging from academia to industry. In this paper, we propose a novel approach based on...

Do democratically chosen rules lead to more cooperation and, hence, higher efficiency, than imposed rules? To discuss when such a "dividend of democracy" obtains, we review experimental studies in which material incentives remain stacked against cooperation (i.e., free-riding incentives prevail)...

In this paper, we introduce a new class of values for cooperative games, named procedural surplus values, which is determined by procedures of sharing marginal surplus. Considering that the level of solidarity among players in a coalition may be related to the size of the coalition, this class...

We consider a committee that consists of n members with one person one vote approving a proposal if the number of affirmative votes from the members reaches threshold k. Which threshold k between 1 and n is "good" for the committee? We suppose that if a new threshold k' proposed by some...

Each value for TU-games satisfying efficiency, symmetric and linear is called an ESL value. We introduce a new value for TU-games with coalition structures, namely the Shapley-ESL value, which applies the Shapley value among coalitions and the ESL value within coalitions. Based on a new basis...

This paper studies the interaction of beliefs, payoff parameters, and the cooperation rate in the infinitely repeated prisoner's dilemma. We show formally that a player's belief about the probability of cooperation by their opponent moderates the effect of changes in the payoff parameters on...

In this article, we consider a solution to the problem of fair distribution of ice cream. This task is a canonical problem discussed in the theory of cooperative games. Although the above-described problem is well known, we propose the simplest approach to its solution. We also compare the...

A global (cooperative) game describes the utility that the whole set of players generates depending on the coalition structure they form. These games were introduced by Gilboa and Lehrer (1991) who proposed and characterized a generalization of the Shapley value. We introduce two families of...

Algorithms play an increasingly important role in economic situations. Often these situations are strategic, where the artificial intelligence may or may not be cooperative. We study the determinants and forms of algorithmic cooperation in the infinitely repeated prisoner's dilemma. We run a...

This paper studies a simple process of demand adjustment in cooperative games. In the process, a randomly chosen player makes the highest possible demand subject to the demands of other coalition members being satisfied. This process converges to the aspiration set; in convex games, this implies...

This paper analyzes the allocation of the total toll collected in a highway among its segments. Based on different toll charging rules, we propose the Segments Equal Sharing method, the Exits Equal Sharing method, and the Entrances Equal Sharing method. We provide axioms and characterize these...

Cooperative games with a permission structure are useful tools for analyzing the impact of hierarchical structures on allocation problems in Economics and Operations Research. In this paper, we propose a generalization of the local disjunctive and the local conjunctive permission approaches...

Experimental studies show that the Nash equilibrium and its refinements are poor predictors of behavior in non-cooperative strategic games. Cooperation models, such as ERC and inequality aversion, yield superior predictions compared to the standard game theory predictions. However, those models...

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and...

In the Inverse Set, relative to the Shapley Value of a non-convex cooperative game, we derive a procedure to find out a convex game in which the Egalitarian Allocation is a coalitional rational value. The procedure depends on the relationship between two parameters called the Convexity Threshold...