Pricing Mechanism for Resource Sustainability in Competitive Online Learning Multi-Agent Systems

10/21/2019
by   Ezra Tampubolon, et al.
0

In this paper, we consider the problem of resource congestion control for competing online learning agents. On the basis of non-cooperative game as the model for the interaction between the agents, and the noisy online mirror ascent as the model for rational behavior of the agents, we propose a novel pricing mechanism which gives the agents incentives for sustainable use of the resources. Our mechanism is distributed and resource-centric, in the sense that it is done by the resources themselves and not by a centralized instance, and that it is based rather on the congestion state of the resources than the preferences of the agents. In case that the noise is persistent, and for several choices of the intrinsic parameter of the agents, such as their learning rate, and of the mechanism parameters, such as the learning rate of -, the progressivity of the price-setters, and the extrinsic price sensitivity of the agents, we show that the accumulative violation of the resource constraints of the resulted iterates is sub-linear w.r.t. the time horizon. Moreover, we provide numerical simulations to support our theoretical findings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2020

Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations

Competitive non-cooperative online decision-making agents whose actions ...
research
02/14/2020

Resource-Aware Control via Dynamic Pricing for Congestion Game with Finite-Time Guarantees

Congestion game is a widely used model for modern networked applications...
research
06/11/2021

Online Learning of Competitive Equilibria in Exchange Economies

The sharing of scarce resources among multiple rational agents is one of...
research
04/09/2014

r-Extreme Signalling for Congestion Control

In many "smart city" applications, congestion arises in part due to the ...
research
03/29/2021

Distributed learning in congested environments with partial information

How can non-communicating agents learn to share congested resources effi...
research
07/20/2022

Careful Autonomous Agents in Environments With Multiple Common Resources

Careful rational synthesis was defined in (Condurache et al. 2021) as a ...
research
01/09/2023

Distributed Multirobot Control for Non-Cooperative Herding

In this paper, we consider the problem of protecting a high-value area f...

Please sign up or login with your details

Forgot password? Click here to reset