Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
From MaRDI portal
Publication:2007652
DOI10.1016/J.AMC.2018.08.032zbMath1429.91012OpenAlexW2891187595MaRDI QIDQ2007652
Wen Jiang, Xinyang Deng, Zhen Wang
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.08.032
Related Items (12)
A generalized belief interval-valued soft set with applications in decision making ⋮ An evidence combination approach based on fuzzy discounting ⋮ An information source selection model based on evolutionary game theory ⋮ A new divergence measure for belief functions in D-S evidence theory for multisensor data fusion ⋮ On the negation of discrete Z-numbers ⋮ Evolution of cooperation driven by diversity on a double-layer square lattice ⋮ The distance of random permutation set ⋮ Identifying influential nodes based on fuzzy local dimension in complex networks ⋮ D number theory based game-theoretic framework in adversarial decision making under a fuzzy environment ⋮ Multi-attribute decision making method based on aggregated neutrosophic set ⋮ Extended matrix norm method: applications to bimatrix games and convergence results ⋮ Emergency alternative evaluation under group decision makers: a new method based on entropy weight and DEMATEL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impact of density and interconnectedness of influential players on social welfare
- Evidential reasoning rule for evidence combination
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Computing Nash equilibria by iterated polymatrix approximation
- Copositive-plus Lemke algorithm solves polymatrix games
- The impact of initial cooperation fraction on the evolutionary fate in a spatial Prisoner's dilemma game
- Games of corruption: how to suppress illegal logging
- Belief functions on real numbers
- Zero-Sum Polymatrix Games: A Generalization of Minmax
- On the Complexity of Approximating a Nash Equilibrium
- Computing Approximate Nash Equilibria in Polymatrix Games
- Inapproximability of Nash Equilibrium
- Approximating Nash Equilibria in Tree Polymatrix Games
- Fundamentals of Evolutionary Game Theory and its Applications
- On separable non-cooperative zero-sum games
- Evolutionary Games and Population Dynamics
- Intuitionistic fuzzy evidential power aggregation operator and its application in multiple criteria decision-making
- The Complexity of Computing a Nash Equilibrium
- On a Network Generalization of the Minmax Theorem
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- Equilibria of Polymatrix Games
This page was built for publication: Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution