Akio Matsumoto, Ferenc Szidarovszky, Maryam Hamidi
The asymptotical properties of a special dynamic two-person game are examined under best-response dynamics in both discrete and continuos time scales. The direction of strategy changes by the players depend on the best responses to the strategies of the competitors and on their own strategies. Conditions are given first for the local asymptotical stability of the equilibrium if instantaneous data are available to the players concerning all current strategies. Next, it is assumed that only delayed information is available about one or more strategies. In the discrete case, the presence of delays has an effect on only the order of the governing difference equations. Under continuous scales, several possibilities are considered: each player has a delay in the strategy of its competitor; player 1 has identical delays in both strategies; the players have identical delays in their own strategies; player 1 has different delays in both strategies; and the players have different delays in their own strategies. In all cases, it is assumed that the equilibrium is asymptotically stable without delays, and we examine how delays can make the equilibrium unstable. For small delays, the stability is preserved. In the cases of one-delay models, the critical value of the delay is determined when stability changes to instability. In the cases of two and three delays, the stability-switching curves are determined in the two-dimensional space of the delays, where stability becomes lost if the delay pair crosses this curve. The methodology is different for the one-, two-, and three-delay cases outlined in this paper.
{"title":"On a Special Two-Person Dynamic Game","authors":"Akio Matsumoto, Ferenc Szidarovszky, Maryam Hamidi","doi":"10.3390/g14060067","DOIUrl":"https://doi.org/10.3390/g14060067","url":null,"abstract":"The asymptotical properties of a special dynamic two-person game are examined under best-response dynamics in both discrete and continuos time scales. The direction of strategy changes by the players depend on the best responses to the strategies of the competitors and on their own strategies. Conditions are given first for the local asymptotical stability of the equilibrium if instantaneous data are available to the players concerning all current strategies. Next, it is assumed that only delayed information is available about one or more strategies. In the discrete case, the presence of delays has an effect on only the order of the governing difference equations. Under continuous scales, several possibilities are considered: each player has a delay in the strategy of its competitor; player 1 has identical delays in both strategies; the players have identical delays in their own strategies; player 1 has different delays in both strategies; and the players have different delays in their own strategies. In all cases, it is assumed that the equilibrium is asymptotically stable without delays, and we examine how delays can make the equilibrium unstable. For small delays, the stability is preserved. In the cases of one-delay models, the critical value of the delay is determined when stability changes to instability. In the cases of two and three delays, the stability-switching curves are determined in the two-dimensional space of the delays, where stability becomes lost if the delay pair crosses this curve. The methodology is different for the one-, two-, and three-delay cases outlined in this paper.","PeriodicalId":35065,"journal":{"name":"Games","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135315604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We exploit the public good attributes of Ganges water pollution cleanup and theoretically analyze an aggregate economy of two cities—Kanpur and Varanasi—through which the Ganges flows. Our specific objective is to study whether water pollution cleanup in these two cities ought to be provided in a centralized or in a decentralized manner. We first determine the efficient cleanup amounts that maximize the aggregate surplus from making the Ganges cleaner in the two cities. Second, we compute the optimal amount of water pollution cleanup in the two cities in a decentralized regime in which spending on cleanup is financed by a uniform tax on the city residents. Third, we ascertain the optimal amount of water pollution cleanup in the two cities in a centralized regime subject to equal provision of cleanup and cost sharing. Fourth, we show that if the two cities have the same preference for pollution cleanup, then centralization is preferable to decentralization as long as there is a spillover from pollution cleanup. Finally, we show that if the two cities have dissimilar preferences for pollution cleanup, then centralization is preferable to decentralization as long as the spillover exceeds a certain threshold.
{"title":"Centralized versus Decentralized Cleanup of River Water Pollution: An Application to the Ganges","authors":"Amitrajeet A. Batabyal, Hamid Beladi","doi":"10.3390/g14050066","DOIUrl":"https://doi.org/10.3390/g14050066","url":null,"abstract":"We exploit the public good attributes of Ganges water pollution cleanup and theoretically analyze an aggregate economy of two cities—Kanpur and Varanasi—through which the Ganges flows. Our specific objective is to study whether water pollution cleanup in these two cities ought to be provided in a centralized or in a decentralized manner. We first determine the efficient cleanup amounts that maximize the aggregate surplus from making the Ganges cleaner in the two cities. Second, we compute the optimal amount of water pollution cleanup in the two cities in a decentralized regime in which spending on cleanup is financed by a uniform tax on the city residents. Third, we ascertain the optimal amount of water pollution cleanup in the two cities in a centralized regime subject to equal provision of cleanup and cost sharing. Fourth, we show that if the two cities have the same preference for pollution cleanup, then centralization is preferable to decentralization as long as there is a spillover from pollution cleanup. Finally, we show that if the two cities have dissimilar preferences for pollution cleanup, then centralization is preferable to decentralization as long as the spillover exceeds a certain threshold.","PeriodicalId":35065,"journal":{"name":"Games","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135300759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Institutions may rely on fundamental principles, e.g., of legal philosophy, but may also have evolved according to institutional fitness, as gauged by a society’s well-being. In our stylized framework where two fundamental principles, equality and efficiency, conflict with each other, one of the three players is the third party who faces two symmetric co-players as culprits and determines whether to sanction the two culprits discriminatorily or treat them with parity. Relying on the theory of equilibrium selection, we derived equilibrium solutions and experimentally tested our behavioral hypotheses. We found that asymmetry in wealth between the two culprits let the sanctioning agent hold the richer culprit more responsible. Furthermore, our results demonstrated that when the sanctioning agent’s decision was observable, sanctioning the two culprits discriminatorily induced them to coordinate on an efficient outcome.
{"title":"When Efficiency Requires Arbitrary Discrimination: Theoretical and Experimental Analysis of Equilibrium Selection","authors":"Werner Güth, Hironori Otsubo","doi":"10.3390/g14050065","DOIUrl":"https://doi.org/10.3390/g14050065","url":null,"abstract":"Institutions may rely on fundamental principles, e.g., of legal philosophy, but may also have evolved according to institutional fitness, as gauged by a society’s well-being. In our stylized framework where two fundamental principles, equality and efficiency, conflict with each other, one of the three players is the third party who faces two symmetric co-players as culprits and determines whether to sanction the two culprits discriminatorily or treat them with parity. Relying on the theory of equilibrium selection, we derived equilibrium solutions and experimentally tested our behavioral hypotheses. We found that asymmetry in wealth between the two culprits let the sanctioning agent hold the richer culprit more responsible. Furthermore, our results demonstrated that when the sanctioning agent’s decision was observable, sanctioning the two culprits discriminatorily induced them to coordinate on an efficient outcome.","PeriodicalId":35065,"journal":{"name":"Games","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136344431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We introduce a new network centrality measure founded on the Gately value for cooperative games with transferable utilities. A directed network is interpreted as representing control or authority relations between players—constituting a hierarchical network. The power distribution embedded within a hierarchical network can be represented through appropriate TU-games. We investigate the properties of these TU-representations and investigate the Gately value of the TU-representation resulting in the Gately power measure. We establish when the Gately measure is a core power gauge, investigate the relationship of the Gately with the β-measure, and construct an axiomatisation of the Gately measure.
{"title":"Game Theoretic Foundations of the Gately Power Measure for Directed Networks","authors":"Robert P. Gilles, Lina Mallozzi","doi":"10.3390/g14050064","DOIUrl":"https://doi.org/10.3390/g14050064","url":null,"abstract":"We introduce a new network centrality measure founded on the Gately value for cooperative games with transferable utilities. A directed network is interpreted as representing control or authority relations between players—constituting a hierarchical network. The power distribution embedded within a hierarchical network can be represented through appropriate TU-games. We investigate the properties of these TU-representations and investigate the Gately value of the TU-representation resulting in the Gately power measure. We establish when the Gately measure is a core power gauge, investigate the relationship of the Gately with the β-measure, and construct an axiomatisation of the Gately measure.","PeriodicalId":35065,"journal":{"name":"Games","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134960612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a 2×2484 matrix game) and Model B3 (a 25×2484 matrix game), both of which depend on a positive-integer parameter d, the number of decks. The key to solving the game under Model B2 was what we called Foster’s algorithm, which applies to additive 2×2n matrix games. Here “additive” means that the payoffs are additive in the n binary choices that comprise a player II pure strategy. In the present paper, we consider analogous models of the casino game baccara chemin de fer that take into account the 100α percent commission on Banker (player II) wins, where 0≤α≤1/10. Thus, the game now depends not just on the discrete parameter d but also on a continuous parameter α. Moreover, the game is no longer zero sum. To find all Nash equilibria under Model B2, we generalize Foster’s algorithm to additive 2×2n bimatrix games. We find that, with rare exceptions, the Nash equilibrium is unique. We also obtain a Nash equilibrium under Model B3, based on Model B2 results, but here we are unable to prove uniqueness.
在之前的一篇论文中，我们考虑了室内游戏baccara chemin de fer的几个模型，包括模型B2 (2×2484矩阵博弈)和模型B3 (25×2484矩阵博弈)，它们都依赖于一个正整数参数d，即牌数。解决B2模型下博弈的关键是我们所说的福斯特算法，它适用于可加性2×2n矩阵博弈。这里的“可加性”指的是组成参与人II纯策略的n个二元选择中的收益是可加性的。在本文中，我们考虑了赌博游戏baccara chemindefer的类似模型，该模型考虑了庄家(玩家II)获胜的100%佣金，其中0≤α≤1/10。因此，博弈现在不仅依赖于离散参数d，还依赖于连续参数α。此外，这场游戏不再是零和博弈。为了找到B2模型下的所有纳什均衡，我们将福斯特算法推广到可加性2×2n双矩阵对策。我们发现，除了极少数例外，纳什均衡是唯一的。基于模型B2的结果，我们也得到了模型B3下的纳什均衡，但我们无法证明唯一性。
{"title":"A Game-Theoretic Analysis of Baccara Chemin de Fer, II","authors":"Stewart N. Ethier, Jiyeon Lee","doi":"10.3390/g14050063","DOIUrl":"https://doi.org/10.3390/g14050063","url":null,"abstract":"In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a 2×2484 matrix game) and Model B3 (a 25×2484 matrix game), both of which depend on a positive-integer parameter d, the number of decks. The key to solving the game under Model B2 was what we called Foster’s algorithm, which applies to additive 2×2n matrix games. Here “additive” means that the payoffs are additive in the n binary choices that comprise a player II pure strategy. In the present paper, we consider analogous models of the casino game baccara chemin de fer that take into account the 100α percent commission on Banker (player II) wins, where 0≤α≤1/10. Thus, the game now depends not just on the discrete parameter d but also on a continuous parameter α. Moreover, the game is no longer zero sum. To find all Nash equilibria under Model B2, we generalize Foster’s algorithm to additive 2×2n bimatrix games. We find that, with rare exceptions, the Nash equilibrium is unique. We also obtain a Nash equilibrium under Model B3, based on Model B2 results, but here we are unable to prove uniqueness.","PeriodicalId":35065,"journal":{"name":"Games","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135817515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We formulate and study a two-player duel game as a terminal payoffs stochastic game. Players P1,P2 are standing in place and, in every turn, each may shoot at the other (in other words, abstention is allowed). If Pn shoots Pm (m≠n), either they hit and kill them (with probability pn) or they miss and Pm is unaffected (with probability 1−pn). The process continues until at least one player dies; if no player ever dies, the game lasts an infinite number of turns. Each player receives a positive payoff upon killing their opponent and a negative payoff upon being killed. We show that the unique stationary equilibrium is for both players to always shoot at each other. In addition, we show that the game also possesses “cooperative” (i.e., non-shooting) non-stationary equilibria. We also discuss a certain similarity that the duel has to the iterated Prisoner’s Dilemma.
{"title":"On the Nash Equilibria of a Duel with Terminal Payoffs","authors":"Athanasios Kehagias","doi":"10.3390/g14050062","DOIUrl":"https://doi.org/10.3390/g14050062","url":null,"abstract":"We formulate and study a two-player duel game as a terminal payoffs stochastic game. Players P1,P2 are standing in place and, in every turn, each may shoot at the other (in other words, abstention is allowed). If Pn shoots Pm (m≠n), either they hit and kill them (with probability pn) or they miss and Pm is unaffected (with probability 1−pn). The process continues until at least one player dies; if no player ever dies, the game lasts an infinite number of turns. Each player receives a positive payoff upon killing their opponent and a negative payoff upon being killed. We show that the unique stationary equilibrium is for both players to always shoot at each other. In addition, we show that the game also possesses “cooperative” (i.e., non-shooting) non-stationary equilibria. We also discuss a certain similarity that the duel has to the iterated Prisoner’s Dilemma.","PeriodicalId":35065,"journal":{"name":"Games","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136153842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource. Additionally, there exists an information asymmetry where each player has knowledge of the reward realizations of different subsets of the resources. If both players choose the same resource, the reward is divided equally between them, whereas if they choose different resources, each player gains the full reward of the resource. We first implement the iterative best response algorithm to find an ϵ-approximate Nash equilibrium for this game. This method of finding a Nash equilibrium may not be desirable when players do not trust each other and place no assumptions on the incentives of the opponent. To handle this case, we solve the problem of maximizing the worst-case expected utility of the first player. The solution leads to counter-intuitive insights in certain special cases. To solve the general version of the problem, we develop an efficient algorithmic solution that combines online convex optimization and the drift-plus penalty technique.
{"title":"A Two-Player Resource-Sharing Game with Asymmetric Information","authors":"Mevan Wijewardena, Michael J. Neely","doi":"10.3390/g14050061","DOIUrl":"https://doi.org/10.3390/g14050061","url":null,"abstract":"This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource. Additionally, there exists an information asymmetry where each player has knowledge of the reward realizations of different subsets of the resources. If both players choose the same resource, the reward is divided equally between them, whereas if they choose different resources, each player gains the full reward of the resource. We first implement the iterative best response algorithm to find an ϵ-approximate Nash equilibrium for this game. This method of finding a Nash equilibrium may not be desirable when players do not trust each other and place no assumptions on the incentives of the opponent. To handle this case, we solve the problem of maximizing the worst-case expected utility of the first player. The solution leads to counter-intuitive insights in certain special cases. To solve the general version of the problem, we develop an efficient algorithmic solution that combines online convex optimization and the drift-plus penalty technique.","PeriodicalId":35065,"journal":{"name":"Games","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135257907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We examine a bargaining game in which players cannot make arbitrary offers. Instead, players alternately decide whether to accept or delay, and are rewarded with an indivisible portion and a perishable transfer that depends on the round. Our analysis demonstrates that when the initial transfer is large enough, the subgame perfect Nash equilibrium consists of a finite number of rounds of delay before an agreement is reached. The equilibrium delay is longer when the players are more patient, and when the transfer is initially higher and depreciates slower. Nevertheless, the game’s chaotic characteristic makes it arduous to forecast the exact number of delayed rounds or which player will make the ultimate decision. This game can be applied to many social scenarios, particularly those with exogenous costs.
{"title":"Delay to Deal: Bargaining with Indivisibility and Round-Dependent Transfer","authors":"Jijian Fan","doi":"10.3390/g14050060","DOIUrl":"https://doi.org/10.3390/g14050060","url":null,"abstract":"We examine a bargaining game in which players cannot make arbitrary offers. Instead, players alternately decide whether to accept or delay, and are rewarded with an indivisible portion and a perishable transfer that depends on the round. Our analysis demonstrates that when the initial transfer is large enough, the subgame perfect Nash equilibrium consists of a finite number of rounds of delay before an agreement is reached. The equilibrium delay is longer when the players are more patient, and when the transfer is initially higher and depreciates slower. Nevertheless, the game’s chaotic characteristic makes it arduous to forecast the exact number of delayed rounds or which player will make the ultimate decision. This game can be applied to many social scenarios, particularly those with exogenous costs.","PeriodicalId":35065,"journal":{"name":"Games","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135784483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper introduces a new quantum game called Quantum Tapsilou that is inspired by the classical traditional Greek coin tossing game tapsilou. The new quantum game, despite its increased complexity and scope, retains the most important characteristic of the traditional game. In the classical game, both players have 14 probability to win. The quantum version retains this characteristic feature, which is that both players have the same probability to win, but only now this probability varies considerably and depends on previous moves and choices. The two most important novelties of Quantum Tapsilou can be attributed to its implementation of entanglement via the use of rotation gates instead of Hadamard gates, which generates Bell-like states with unequal probability amplitudes, and the integral use of groups. In Quantum Tapsilou both players agree on a specific cyclic rotation group of order n, for some sufficiently large n. The game is based on the chosen group, in the sense that both players will draw their moves from its elements. More specifically, both players will pick rotations from this group to realize their actions using the corresponding Ry rotation gates. In the Quantum Tapsilou game, it is equally probable for both players to win. This fact is in accordance with a previous result in the literature showing that quantum games where both players choose their actions from the same group, exhibit perfect symmetry by providing each player with the possibility to pick the move that counteracts the other player’s action.
本文介绍了一种名为 "量子塔普西罗"（Quantum Tapsilou）的新量子游戏，其灵感来自希腊传统的经典掷硬币游戏 "塔普西罗"（tapsilou）。尽管新量子游戏的复杂性和范围都有所增加，但它保留了传统游戏最重要的特点。在古典游戏中，双方都有 14 的概率获胜。量子版保留了这一特点，即双方都有相同的获胜概率，只是现在这种概率变化很大，而且取决于之前的棋步和选择。量子塔普西罗的两个最重要的新颖之处可归因于它通过使用旋转门而不是哈达玛门实现了纠缠，从而产生了具有不等概率振幅的类似贝尔的状态，以及组的整体使用。在量子塔普西罗棋中，棋手双方都同意在某个足够大的 n 中选择一个特定的 n 阶循环旋转群。更具体地说，双方都将从这个组中选择旋转，使用相应的 Ry 旋转门来实现他们的行动。在量子塔普西罗棋局中，双方获胜的可能性相同。这一事实与之前文献中的一个结果相一致，即量子博弈中，如果双方都从同一组中选择棋子，那么双方都有可能选择与对方的棋子相抵消的棋子，从而表现出完美的对称性。
{"title":"Quantum Tapsilou—A Quantum Game Inspired by the Traditional Greek Coin Tossing Game Tapsilou","authors":"Kalliopi Kastampolidou, T. Andronikos","doi":"10.3390/g14060072","DOIUrl":"https://doi.org/10.3390/g14060072","url":null,"abstract":"This paper introduces a new quantum game called Quantum Tapsilou that is inspired by the classical traditional Greek coin tossing game tapsilou. The new quantum game, despite its increased complexity and scope, retains the most important characteristic of the traditional game. In the classical game, both players have 14 probability to win. The quantum version retains this characteristic feature, which is that both players have the same probability to win, but only now this probability varies considerably and depends on previous moves and choices. The two most important novelties of Quantum Tapsilou can be attributed to its implementation of entanglement via the use of rotation gates instead of Hadamard gates, which generates Bell-like states with unequal probability amplitudes, and the integral use of groups. In Quantum Tapsilou both players agree on a specific cyclic rotation group of order n, for some sufficiently large n. The game is based on the chosen group, in the sense that both players will draw their moves from its elements. More specifically, both players will pick rotations from this group to realize their actions using the corresponding Ry rotation gates. In the Quantum Tapsilou game, it is equally probable for both players to win. This fact is in accordance with a previous result in the literature showing that quantum games where both players choose their actions from the same group, exhibit perfect symmetry by providing each player with the possibility to pick the move that counteracts the other player’s action.","PeriodicalId":35065,"journal":{"name":"Games","volume":"47 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139343065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Water scarcity is a growing problem in many regions worldwide. According to the United Nations, around one-fifth of the world’s population lives in areas where water is scarce. Another one-quarter of the world’s population has to face water supply cuts, mainly because this proportion of the population lacks the necessary infrastructure to acquire water from rivers and aquifers (UN, 2005). Water is a resource that is essential to human survival and is also present in all productive processes in the economy. Therefore, we are challenged to adequately manage water to ensure the population’s well-being and to achieve socioeconomic development. Specifically, this paper analyzes the situation present in the summer of 2022 at Riudecanyes (a village in Catalonia, Spain), where a drought problem exists. We propose applying the conflicting claims problem theory to give possible solutions to distribute the water. We propose to use this theory to describe the distribution of the available irrigation hours in 2022, considering the demand made by the farmers in the previous year, when there was regular irrigation.
{"title":"The Art of Sharing Resources: How to Distribute Water during a Drought Period","authors":"Sebastián Cano-Berlanga, María-José Solís-Baltodano, Cori Vilella","doi":"10.3390/g14050059","DOIUrl":"https://doi.org/10.3390/g14050059","url":null,"abstract":"Water scarcity is a growing problem in many regions worldwide. According to the United Nations, around one-fifth of the world’s population lives in areas where water is scarce. Another one-quarter of the world’s population has to face water supply cuts, mainly because this proportion of the population lacks the necessary infrastructure to acquire water from rivers and aquifers (UN, 2005). Water is a resource that is essential to human survival and is also present in all productive processes in the economy. Therefore, we are challenged to adequately manage water to ensure the population’s well-being and to achieve socioeconomic development. Specifically, this paper analyzes the situation present in the summer of 2022 at Riudecanyes (a village in Catalonia, Spain), where a drought problem exists. We propose applying the conflicting claims problem theory to give possible solutions to distribute the water. We propose to use this theory to describe the distribution of the available irrigation hours in 2022, considering the demand made by the farmers in the previous year, when there was regular irrigation.","PeriodicalId":35065,"journal":{"name":"Games","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48570039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：