The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games

The article considers some aspects of the patronized goods theory with respect to efficient and inefficient equilibria. The author analyzes specific features of patronized goods as well as their connection with market failures, and conjectures that they are related to the emergence of Pareto-inefficient Nash equilibria. The key problem is the analysis of the opportunities for transforming inefficient Nash equilibrium into Pareto-optimal Nash equilibrium for patronized goods by modifying the institutional environment. The paper analyzes social motivation for institutional modernization and equilibrium conditions in the generalized Wicksell-Lindahl model for patronized goods. The author also considers some applications of patronized goods theory to social policy issues.

Download Full-text

Asynchronous distributed algorithm for seeking generalized Nash equilibria

2018 European Control Conference (ECC) ◽

10.23919/ecc.2018.8550331 ◽

2018 ◽

Cited By ~ 1

Author(s):

Peng Yi ◽

Lacra Pavel

Keyword(s):

Distributed Algorithm ◽

Nash Equilibria ◽

Generalized Nash Equilibria

Download Full-text

Bipolar Abstract Argumentation with Dual Attacks and Supports

Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning ◽

10.24963/kr.2020/69 ◽

2020 ◽

Author(s):

Nico Potyka

Keyword(s):

Computational Complexity ◽

Decision Problems ◽

Abstract Argumentation ◽

Stable Semantics ◽

Support Relations ◽

Support Relationships ◽

Computational Properties ◽

Inherent Tendency

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.

Download Full-text