1 citations · 1 across the 5 of their papers we have counts for
5 papers
Almost Sure Convergence of Networked Policy Gradient over Time-Varying Networks in Markov Potential Games
Sarper Aydin, Ceyhun Eksin
We propose networked policy gradient play for solving Markov potential games with continuous and/or discrete state-action pairs. During the game, agents use parametrized and differ…
Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games
Sarper Aydin, Sina Arefizadeh, Ceyhun Eksin
We investigate convergence of decentralized fictitious play (DFP) in near-potential games, wherein agents preferences can almost be captured by a potential function. In DFP agents…
Decentralized Inertial Best-Response with Voluntary and Limited Communication in Random Communication Networks
Sarper Aydın, Ceyhun Eksin
Multiple autonomous agents interact over a random communication network to maximize their individual utility functions which depend on the actions of other agents. We consider dece…
Decentralized Fictitious Play in Near-Potential Games with Time-Varying Communication Networks
Sarper Aydın, Sina Arefizadeh, Ceyhun Eksin
We study the convergence properties of decentralized fictitious play (DFP) for the class of near-potential games where the incentives of agents are nearly aligned with a potential…
A Best-Response Algorithm with Voluntary Communication and Mobility Protocols for Mobile Autonomous Teams Solving the Target Assignment Problem
Sarper Aydin, Ceyhun Eksin
We consider a team of mobile autonomous robots with the aim to cover a given set of targets. Each robot aims to select a target to cover and physically reach it by the final time i…