pull” from the players than others (e.g., more energy or power). Our algorithm selects with high probability the “minimal equilibrium

Moreover, we show that the game switches happen only a finite number of times

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.GT · 2025-09-24 · unverdicted · novelty 4.0

A new distributed algorithm for Meta Tug-of-War games converges to QoS-satisfying equilibria using stochastic updates and infrequent communication.

Showing 1 of 1 citing paper.

Choose Your Battles: Distributed Learning Over Multiple Tug of War Games cs.GT · 2025-09-24 · unverdicted · none · ref 1
A new distributed algorithm for Meta Tug-of-War games converges to QoS-satisfying equilibria using stochastic updates and infrequent communication.