Incentivizing prosumer coalitions with energy management using cooperative game theory

L Han, T Morstyn, M McCulloch - IEEE Transactions on Power …, 2018 - ieeexplore.ieee.org
The advances in distributed renewable generation technologies in recent years have started
to cause load balancing issues in power networks. Distributed energy storage (ES) systems …

Decentralized charging control of large populations of plug-in electric vehicles

Z Ma, DS Callaway, IA Hiskens - IEEE Transactions on control …, 2011 - ieeexplore.ieee.org
This paper develops a strategy to coordinate the charging of autonomous plug-in electric
vehicles (PEVs) using concepts from non-cooperative games. The foundation of the paper is …

Multiplicative weights update with constant step-size in congestion games: Convergence, limit cycles and chaos

G Palaiopanos, I Panageas… - Advances in Neural …, 2017 - proceedings.neurips.cc
Abstract The Multiplicative Weights Update (MWU) method is a ubiquitous meta-algorithm
that works as follows: A distribution is maintained on a certain set, and at each step the …

Convergence to approximate Nash equilibria in congestion games

S Chien, A Sinclair - Games and Economic Behavior, 2011 - Elsevier
We study the ability of decentralized, local dynamics in non-cooperative games to rapidly
reach an approximate (pure) Nash equilibrium. Our main result states that for symmetric …

Energy-spectrum efficiency tradeoff for video streaming over mobile ad hoc networks

L Zhou, RQ Hu, Y Qian, HH Chen - IEEE Journal on Selected …, 2013 - ieeexplore.ieee.org
In this work, we investigate the properties of energy-efficiency (EE) and spectrum-efficiency
(SE) for video streaming over mobile ad hoc networks by develo** an energy-spectrum …

Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games

A Blum, E Even-Dar, K Ligett - Proceedings of the twenty-fifth annual …, 2006 - dl.acm.org
There has been substantial work develo** simple, efficient no-regret algorithms for a wide
class of repeated decision-making problems including online routing. These are adaptive …

Fast convergence to Wardrop equilibria by adaptive sampling methods

S Fischer, H Räcke, B Vöcking - Proceedings of the thirty-eighth annual …, 2006 - dl.acm.org
We study rerouting policies in a dynamic round-based variant of a well known game
theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish …

Scaling up cooperative game theory-based energy management using prosumer clustering

L Han, T Morstyn, MD McCulloch - IEEE Transactions on Smart …, 2020 - ieeexplore.ieee.org
Game theory based energy sharing schemes emerged in recent years to incentivize efficient
management of the increasing amount of distributed energy resources. Among these …

Replex: dynamic traffic engineering based on wardrop routing policies

S Fischer, N Kammenhuber, A Feldmann - Proceedings of the 2006 …, 2006 - dl.acm.org
One major challenge in communication networks is the problem of dynamically distributing
load in the presence of bursty and hard to predict changes in traffic demands. Current traffic …

[PDF][PDF] Selfish load balancing

B Vöcking - Algorithmic game theory, 2007 - cs.cmu.edu
Suppose that a set of weighted tasks shall be assigned to a set of machines with possibly
different speeds such that the load is distributed evenly among the machines. In computer …