Results 21 to 30 of about 1,214,649 (366)
Chaotic triopoly game: a congestion case
Advances in Difference Equations, 2020 In this paper, we propose a simple network consisting of only two nodes and two paths. The first node, which is called the source, has three competing firms that send their quantities of load via the two paths to the second node, called the destination ...
S. S. Askar, A. Al-khedhairi
doaj +1 more source
Is Having a Unique Equilibrium Robust? [PDF]
, 2007 We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to perturbation of the payoffs, both for Nash equilibrium and correlated equilibrium.
Aumann +12 more
core +5 more sources
International Journal of Robust and Nonlinear Control, EarlyView., 2023 Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source
Comparing competition equilibrium with nash equilibrium in electric power market
CSEE Journal of Power and Energy Systems, 2018 The Nash equilibrium and competition equilibrium have been widely studied in the electric power market up to now. In this paper, it is explained that the Nash equilibrium can be achieved by using marginal cost pricing and the competition equilibrium can ...
Haibing Wang +4 more
doaj +1 more source
Implementation in mixed Nash equilibrium [PDF]
, 2009 A mechanism implements a social choice correspondence f in mixed Nash equilibrium if at any preference profile, the set of all pure and mixed Nash equilibrium outcomes coincides with the set of f-optimal alternatives at that preference profile.
Mezzetti, Claudio, Renou, Ludovic
core +2 more sources
Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks [PDF]
IEEE Transactions on Automatic Control, 2019 We design the first fully distributed algorithm for generalized Nash equilibrium seeking in aggregative games on a time-varying communication network, under partial-decision information, i.e., the agents have no direct access to the aggregate decision ...
Giuseppe Belgioioso +2 more
semanticscholar +1 more source
A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks [PDF]
IEEE Transactions on Automatic Control, 2017 In this paper, we consider the problem of distributed Nash equilibrium (NE) seeking over networks, a setting in which players have limited local information on the others’ decisions.
Dian Gadjov, Lacra Pavel
semanticscholar +1 more source
Distributed Nash Equilibrium Seeking for Games in Systems With Bounded Control Inputs [PDF]
IEEE Transactions on Automatic Control, 2019 Noticing that actuator limitations are ubiquitous in practical engineering systems, this article considers Nash equilibrium seeking for games in systems where the control inputs are bounded.
Maojiao Ye
semanticscholar +1 more source
Multi-Time Generalized Nash Equilibria with Dynamic Flow Applications
Mathematics, 2021 We propose a multi-time generalized Nash equilibrium problem and prove its equivalence with a multi-time quasi-variational inequality problem. Then, we establish the existence of equilibria.
Shipra Singh, Aviv Gibali, Simeon Reich
doaj +1 more source
Distributed Robust Seeking of Nash Equilibrium for Networked Games: An Extended State Observer-Based Approach [PDF]
IEEE Transactions on Cybernetics, 2019 This article aims to accommodate networked games in which the players’ dynamics are subjected to unmodeled and disturbance terms. The unmodeled and disturbance terms are regarded as extended states for which observers are designed to estimate them ...
Maojiao Ye
semanticscholar +1 more source