BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20230303T120000Z
UID:f7dfee40642e40b3a47b495e25a4ed19-422
DTSTAMP:19700101T120011Z
DESCRIPTION:A decentralised algorithm for minimizing multi-agent congestion cost on a network
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/422/a-decentralised-algorithm-for-minimizing-multi-agent-congestion-cost-on-a-network/
SUMMARY:Consider a model wherein a given set of agents need to reach the goal node of a network. The cost for each agent on any link depends on the congestion on that link as well as on a cost component that is private to that agent. We propose a multi-agent congestion cost minimization (MACCM) algorithm for minimizing the total cost incurred by the agents. Our algorithm is fully decentralised, uses linear function approximations that addresses privacy of agents costs as well as scalability aspects and achieves sub-linear regret. Each agent maintains an estimate of the global objective function and the algorithm relies on a multi-agent version of extended value-iteration. We illustrate computations on a hard instance. Our model is a generalisation of a classical learning problem, the stochastic shortest path problem. This is a joint work with Prashant Trivedi.
DTSTART:20230303T120000Z
END:VEVENT
END:VCALENDAR