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

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions to every TU-game. In the literature various models of games...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of...

Three well-known solutions for cooperative TU-games are the Shapley value, the Banzhaf value and the equal division solution. In the literature various axiomatizations of these solutions can be found. Axiomatizations of the Shapley value often use efficiency which is not satisfied by the Banzhaf...

In this paper we consider the problem of sharing water from a river among a group of agents (countries, cities, firms) located along the river. The benefit of each agent depends on the amount of water consumed by the agent. An allocation of the water among the agents is efficient when it...

We generalize the null player property (satisfied by the Shapley value) and nullifying player property (satisfied by the equal division solution) to the so-called delta-reducing player property, stating that a delta-reducing player (being a player such that any coalition containing this player...

In a standard TU-game it is assumed that every subset of the player set can form a coalition and earn its worth. One of the first models where restrictions in cooperation are considered is the one of games with coalition structure. In such games the player set is partitioned into unions and...

A situation in which a finite set of agents can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility (or simply a TU-game) where each agent is represented by one player in the game. In this paper, we assume that one agent can be represented by...