Stochastic Games for Smart Grid Energy Management with Prospect Prosumers
Not on the map. Why?
Abstract (arXiv)
In this paper, the problem of smart grid energy management under stochastic dynamics is investigated. In the considered model, at the demand side, it is assumed that customers can act as prosumers who own renewable energy sources and can both produce and consume energy. Due to the coupling between the prosumers' decisions and the stochastic nature of renewable energy, the interaction among prosumers is formulated as a stochastic game, in which each prosumer seeks to maximize its payoff, in terms of revenues, by controlling its energy consumption and demand. In particular, the subjective behavior of prosumers is explicitly reflected into their payoff functions using prospect theory, a powerful framework that allows modeling real-life human choices. For this prospect-based stochastic game, it is shown that there always exists a stationary Nash equilibrium where the prosumers' trading policies in the equilibrium are independent of the time and their histories of the play. Moreover, a novel distributed algorithm with no information sharing among prosumers is proposed and shown to converge to an ε-Nash equilibrium. On the other hand, at the supply side, the interaction between the utility company and the prosumers is formulated as an online optimization problem in which the utility company's goal is to learn its optimal energy allocation rules. For this case, it is shown that such an optimization problem admits a no-regret algorithm meaning that regardless of the actual outcome of the game among the prosumers, the utility company can follow a strategy that mitigates its allocation costs as if it knew the entire demand market a priori. Simulation results show the convergence of the proposed algorithms to their predicted outcomes and present new insights resulting from prospect theory that contribute toward more efficient energy management in the smart grids.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Oct 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 2; 2026: 2.
6 papers.
- 2022Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chainscited by 7
- 2023Scalable and Independent Learning of Nash Equilibrium Policies in n-Player Stochastic Games with Unknown Independent Chainscited by 1
- 2026Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamicscited by 1
- 2025Policy Optimization and Multi-agent Reinforcement Learning for Mean-variance Team Stochastic Gamescited by 0
- 2025Independent policy gradient-based reinforcement learning for economic and reliable energy management of multi-microgrid systemscited by 0
- 2026Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chainscited by 0
- 2026Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains1 Oct 2026
- 2026Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamics7 May 2026
- 2025Independent policy gradient-based reinforcement learning for economic and reliable energy management of multi-microgrid systems26 Nov 2025
- 2025Policy Optimization and Multi-agent Reinforcement Learning for Mean-variance Team Stochastic Games28 Mar 2025
- 2023Scalable and Independent Learning of Nash Equilibrium Policies in n-Player Stochastic Games with Unknown Independent Chains4 Dec 2023
- 2022Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chains28 Jan 2022