default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarper Aydin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Sarper Aydin, Orhan Eren Akgün, Stephanie Gil, Angelia Nedic:
Multi-Agent Resilient Consensus under Intermittent Faulty and Malicious Transmissions (Extended Version). CoRR abs/2403.17907 (2024)- 2023
- [j3]Sarper Aydin
, Ceyhun Eksin:
A Best-Response Algorithm With Voluntary Communication and Mobility Protocols for Mobile Autonomous Teams Solving the Target Assignment Problem. IEEE Trans. Control. Syst. Technol. 31(6): 2835-2847 (2023) - [c7]Sarper Aydin, Ceyhun Eksin:
Policy Gradient Play Over Time-Varying Networks in Markov Potential Games. CDC 2023: 1997-2002 - [c6]Sarper Aydin, Ceyhun Eksin:
Networked Policy Gradient Play in Markov Potential Games. ICASSP 2023: 1-5 - [c5]Sarper Aydin, Ceyhun Eksin:
Policy Gradient Play with Networked Agents in Markov Potential Games. L4DC 2023: 184-195 - 2022
- [j2]Sarper Aydin, Ceyhun Eksin:
Decentralized inertial best-response with voluntary and limited communication in random communication networks. Autom. 145: 110566 (2022) - [j1]Sarper Aydin, Sina Arefizadeh, Ceyhun Eksin:
Decentralized Fictitious Play in Near-Potential Games With Time-Varying Communication Networks. IEEE Control. Syst. Lett. 6: 1226-1231 (2022) - [c4]Sarper Aydin, Sina Arefizadeh, Ceyhun Eksin:
Convergence Bounds of Decentralized Fictitious Play Around a Single Nash Equilibrium in Near-Potential Games. CDC 2022: 2519-2524 - [i4]Sarper Aydin, Sina Arefizadeh, Ceyhun Eksin:
Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games. CoRR abs/2201.11854 (2022) - 2021
- [c3]Sarper Aydin, Sina Arefizadeh, Ceyhun Eksin:
Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games. ACSCC 2021: 998-1002 - [i3]Sarper Aydin, Sina Arefizadeh, Ceyhun Eksin:
Decentralized Fictitious Play in Near-Potential Games with Time-Varying Communication Networks. CoRR abs/2103.09845 (2021) - [i2]Sarper Aydin, Ceyhun Eksin:
Decentralized Inertial Best-Response with Voluntary and Limited Communication in Random Communication Networks. CoRR abs/2106.07079 (2021) - 2020
- [c2]Sarper Aydin, Ceyhun Eksin:
Communication Censoring in Decentralized Fictitious Play for the Target Assignment Problem. CCTA 2020: 334-339 - [c1]Sarper Aydin, Ceyhun Eksin:
Decentralized Fictitious Play with Voluntary Communication in Random Communication Networks. CDC 2020: 337-342 - [i1]Sarper Aydin, Ceyhun Eksin:
Decentralized Learning-aware Communication and Communication-aware Mobility Control for the Target Assignment Problem. CoRR abs/2003.03225 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
