FISHERY MANAGEMENT GAMES: HOW TO ADMIT NEW MEMBERS AND REDUCE HARVESTING LEVELS

2008 ◽  
Vol 10 (03) ◽  
pp. 319-333 ◽  
Author(s):  
KIM HANG PHAM DO ◽  
HENK FOLMER ◽  
HENK NORDE
Keyword(s):  
Game Theory ◽  
Nash Equilibrium ◽  
Shapley Value ◽  
Fishery Management ◽  
Proportional Rule ◽  
Allocation Scheme ◽  
New Members ◽  
Population Monotonic Allocation Scheme ◽  
Management Games ◽  
Monotonic Allocation Scheme

This paper applies game theory to address the problem of allocating profits among fishing nations, once the countries concerned have expressed an interest in achieving an agreement through a Regional Fishery Management Organization (RFMO). Proposing the population monotonic allocation scheme as management rule for division of profits, we argue that existing RFMOs can be expanded by means of the Shapley value. We also show that adjustment from the Nash equilibrium to sustainable or more efficient can be achieved by means of the proportional rule without harming any of the countries involved.

scholarly journals A NOTE ON NTU CONVEXITY AND POPULATION MONOTONIC ALLOCATION SCHEMES

2003 ◽  
Vol 05 (04) ◽  
pp. 385-390
Author(s):  
RUUD HENDRICKX
Keyword(s):  
Cooperative Games ◽  
Transferable Utility ◽  
Allocation Scheme ◽  
Population Monotonic Allocation Scheme ◽  
Monotonic Allocation Scheme ◽  
Population Monotonic Allocation Schemes

For cooperative games with transferable utility, convexity has turned out to be an important and widely applicable concept, mainly because it implies some very nice and handy properties. One of these is that every extended marginal vector constitutes a population monotonic allocation scheme. In this note, this well-known result is generalised to games with nontransferable utility.

scholarly journals INFORMATION SHARING GAMES

2003 ◽  
Vol 05 (01) ◽  
pp. 1-12 ◽  
Author(s):  
MARCO SLIKKER ◽  
HENK NORDE ◽  
STEF TIJS
Keyword(s):  
Information Sharing ◽  
Cooperative Game ◽  
Cooperative Games ◽  
Allocation Scheme ◽  
Population Monotonic Allocation Scheme ◽  
Monotonic Allocation Scheme

In this paper we study information sharing situations. For every information sharing situation we construct an associated cooperative game, which we call an information sharing game. We show that the class of information sharing games coincides with the class of cooperative games with a population monotonic allocation scheme.

scholarly journals Convex Interval Games

2009 ◽  
Vol 2009 ◽  
pp. 1-14 ◽  
Author(s):  
S. Z. Alparslan Gök ◽  
R. Branzei ◽  
S. Tijs
Keyword(s):  
Game Theory ◽  
Cooperative Game ◽  
Shapley Value ◽  
Cooperative Game Theory ◽  
Allocation Scheme ◽  
Weber Set ◽  
The Shapley Value ◽  
Interval Games

Convex interval games are introduced and characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for convex interval games are established. The notion of population monotonic interval allocation scheme (pmias) in the interval setting is introduced and it is proved that each element of the Weber set of a convex interval game is extendable to such a pmias. A square operator is introduced which allows us to obtain interval solutions starting from the corresponding classical cooperative game theory solutions. It turns out that on the class of convex interval games the square Weber set coincides with the interval core.

scholarly journals Holding a group together: non-game-theory vs. game-theory

2021 ◽  
Author(s):  
Michael Richter ◽  
Ariel Rubinstein
Keyword(s):  
Game Theory ◽  
Nash Equilibrium ◽  
Competitive Equilibrium ◽  
Solution Concept ◽  
Equilibrium Concept

Abstract Each member of a group chooses a position and has preferences regarding his chosen position. The group’s harmony depends on the profile of chosen positions meeting a specific condition. We analyse a solution concept (Richter and Rubinstein, 2020) based on a permissible set of individual positions, which plays a role analogous to that of prices in competitive equilibrium. Given the permissible set, members choose their most preferred position. The set is tightened if the chosen positions are inharmonious and relaxed if the restrictions are unnecessary. This new equilibrium concept yields more attractive outcomes than does Nash equilibrium in the corresponding game.

scholarly journals Quantum Mean-Field Games with the Observations of Counting Type

Games ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 7
Author(s):  
Vassili N. Kolokoltsov
Keyword(s):  
Game Theory ◽  
Nash Equilibrium ◽  
Open Problem ◽  
Existence And Uniqueness ◽  
Existence Of Solutions ◽  
Mean Field ◽  
Mean Field Games ◽  
Quantum Game ◽  
Quantum Games ◽  
Interesting Open Problem

Quantum games and mean-field games (MFG) represent two important new branches of game theory. In a recent paper the author developed quantum MFGs merging these two branches. These quantum MFGs were based on the theory of continuous quantum observations and filtering of diffusive type. In the present paper we develop the analogous quantum MFG theory based on continuous quantum observations and filtering of counting type. However, proving existence and uniqueness of the solutions for resulting limiting forward-backward system based on jump-type processes on manifolds seems to be more complicated than for diffusions. In this paper we only prove that if a solution exists, then it gives an ϵ-Nash equilibrium for the corresponding N-player quantum game. The existence of solutions is suggested as an interesting open problem.

Query Games in Databases

2021 ◽  
Vol 50 (1) ◽  
pp. 78-85
Author(s):  
Ester Livshits ◽  
Leopoldo Bertossi ◽  
Benny Kimelfeld ◽  
Moshe Sebag
Keyword(s):  
Game Theory ◽  
Cooperative Game ◽  
Shapley Value ◽  
Cooperative Game Theory ◽  
The Shapley Value ◽  
Computational Aspects ◽  
Aggregate Query ◽  
Boolean Query

Database tuples can be seen as players in the game of jointly realizing the answer to a query. Some tuples may contribute more than others to the outcome, which can be a binary value in the case of a Boolean query, a number for a numerical aggregate query, and so on. To quantify the contributions of tuples, we use the Shapley value that was introduced in cooperative game theory and has found applications in a plethora of domains. Specifically, the Shapley value of an individual tuple quantifies its contribution to the query. We investigate the applicability of the Shapley value in this setting, as well as the computational aspects of its calculation in terms of complexity, algorithms, and approximation.

Shapley Ranking of Wines

2012 ◽  
Vol 7 (2) ◽  
pp. 169-180 ◽  
Author(s):  
Victor Ginsburgh ◽  
Israël Zang
Keyword(s):  
Game Theory ◽  
Unique Solution ◽  
Cooperative Game ◽  
Shapley Value ◽  
Rank Order ◽  
Jel Classification ◽  
Ranking Method ◽  
The Shapley Value ◽  
Shapley Values

AbstractWe suggest a new game-theory-based ranking method for wines, in which the Shapley Value of each wine is computed, and wines are ranked according to their Shapley Values. Judges should find it simpler to use, since they are not required to rank order or grade all the wines, but merely to choose the group of those that they find meritorious. Our ranking method is based on the set of reasonable axioms that determine the Shapley Value as the unique solution of an underlying cooperative game. Unlike in the general case, where computing the Shapley Value could be complex, here the Shapley Value and hence the final ranking, are straightforward to compute. (JEL Classification: C71, D71, D78)

Sign in / Sign up

Export Citation Format

Share Document