Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1903.03922

A Motivational Game-Theoretic Approach for Peer-to-Peer Energy Trading in the Smart Grid

Wayes Tushar·Tapan Kumar Saha·Chau Yuen·Thomas Morstyn·Malcolm D. McCulloch·H. Vincent Poor·Kristin L. Wood
View original source ↗Read source document ↗Export metadata ↓

Abstract

Peer-to-peer trading in energy networks is expected to be exclusively conducted by the prosumers of the network with negligible influence from the grid. This raises the critical question: how can enough prosumers be encouraged to participate in peer-to-peer trading so as to make its operation sustainable and beneficial to the overall electricity network? To this end, this paper proposes how a motivational psychology framework can be used effectively to design peer-to-peer energy trading to increase user participation. To do so, first, the state-of-the-art of peer-to-peer energy trading literature is discussed by following a systematic classification, and gaps in existing studies are identified. Second, a motivation psychology framework is introduced, which consists of a number of motivational models that a prosumer needs to satisfy before being convinced to participate in energy trading. Third, a game-theoretic peer-to-peer energy trading scheme is developed, its relevant properties are studied, and it is shown that the coalition among different prosumers is a stable coalition. Fourth, through numerical case studies, it is shown that the proposed model can reduce carbon emissions by 18.38% and 9.82% in a single day in Summer and Winter respectively compared to a feed-in-tariff scheme. The proposed scheme is also shown to reduce the cost of energy up to 118 cents and 87 cents per day in Summer and Winter respectively. Finally, how the outcomes of the scheme satisfy all the motivational psychology models is discussed, which subsequently shows its potential to attract users to participate in energy trading.

Explore related subjects

cs.GTcs.NI

Keep this discovery

BibTeXRIS

Wayes Tushar, Tapan Kumar Saha, Chau Yuen, Thomas Morstyn, Malcolm D. McCulloch, H. Vincent Poor, Kristin L. Wood. 2019-03-10. A Motivational Game-Theoretic Approach for Peer-to-Peer Energy Trading in the Smart Grid. https://arxiv.org/abs/1903.03922

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗