scholarly journals Non-Zero Sum Network Games with Pairwise Interactions

2021 ◽  
Vol 14 ◽  
pp. 38-48
Author(s):  
Mariia A. Bulgakova ◽  
Keyword(s):  
Shapley Value ◽  
Network Formation ◽  
Network Games ◽  
Zero Sum Games ◽  
Pairwise Interactions ◽  
Formation Stage ◽  
The Shapley Value ◽  
Cooperative Solutions ◽  
Zero Sum ◽  
Network Form

In the paper non-zero sum games on networks with pairwise interactions are investigated. The first stage is network formation stage, where players chose their preferable set of neighbours. In all following stages simultaneous non-zero sum game appears between connected players in network. As cooperative solutions the Shapley value and τ -value are considered. Due to a construction of characteristic function both formulas are simpli ed. It is proved, that the coeffcient λ in τ -value is independent from network form and number of players or neighbours and is equal to 1/2 . Also it is proved that in this type of games on complete network the Shapley value and τ -value are coincide.

Trade with Technology Spillover: A Dynamic Network Game Analysis

2020 ◽  
pp. 2050011
Author(s):  
David W. K. Yeung ◽  
Leon A. Petrosyan ◽  
Yingxuan Zhang
Keyword(s):  
Shapley Value ◽  
General Class ◽  
Dynamic Network ◽  
Technology Spillover ◽  
Network Games ◽  
Game Analysis ◽  
The Shapley Value ◽  
Positive Externalities ◽  
Network Game ◽  
Representative Model

This paper presents a general class of dynamic network games to analyze trade with technology spillover. Due to the fact that the benefits of technology spillover are not fully accrued to the technology developer, the positive externalities are under-exploited. The cooperative solution yields an optimal outcome. To reflect the contributions of individual agents to the network, the Shapley value is used as a solution optimality principle in sharing the cooperative gains. A time-consistent payoff imputation procedure is derived to maintain the Shapley value at each stage of the cooperation. A representative model based on the general class of network games with explicit functional form is given. This is the first time that trade with technology spillover is studied in the framework of dynamic network games, further studies along this line are expected.

scholarly journals The 3P Challenge: A Serious Game for Reflecting on Partnership in Public-Private Concessions

2020 ◽  
pp. 1087724X2098158
Author(s):  
Camilo Benitez-Avila ◽  
Andreas Hartmann ◽  
Geert Dewulf
Keyword(s):  
Process Management ◽  
Project Managers ◽  
Serious Game ◽  
Public Private Partnerships ◽  
Mixed Group ◽  
Public Project ◽  
Zero Sum Games ◽  
Management Literature ◽  
Contractual Obligations ◽  
Zero Sum

Process management literature is skeptical about creating legitimacy and a sense of partnership when implementing concessional Public-Private Partnerships. Within such organizational arrangements, managerial interaction often resembles zero-sum games. To explore the possibility to (re)create a sense of partnership in concessional PPPs, we developed the “3P challenge” serious game. Two gaming sessions with a mixed group of practitioners and a team of public project managers showed that the game cycle recreates adversarial situations where players can enact contractual obligations with higher or lower levels of subjectivity. When reflecting on the gaming experience, practitioners point out that PPP contracts can be creatively enacted by managers who act as brokers of diverse interests. While becoming aware of each other stakes they can blend contractual dispositions or place brackets around some contractual clauses for reaching agreement. By doing so, they can (re)create a sense of partnership, clarity, and fairness of the PPP contract.

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.

Sign in / Sign up

Export Citation Format

Share Document