default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustafa O. Karabag
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Mustafa O. Karabag, Melkior Ornik, Ufuk Topcu:
Identity concealment games: How I learned to stop revealing and love the coincidences. Autom. 161: 111482 (2024)- [c11]Mustafa O. Karabag, Sophia Smith, David Fridovich-Keil, Ufuk Topcu:
Encouraging Inferable Behavior for Autonomy: Repeated Bimatrix Stackelberg Games with Observations. ACC 2024: 360-366 - [c10]Shenghui Chen, Yagiz Savas, Mustafa O. Karabag, Brian M. Sadler, Ufuk Topcu:
Deceptive Planning for Resource Allocation. ACC 2024: 4188-4195 - [i11]Surya Murthy, Mustafa O. Karabag, Ufuk Topcu:
Autonomous Negotiation Using Comparison-Based Gradient Estimation. CoRR abs/2408.11186 (2024) - 2023
- [j4]Tichakorn Wongpiromsarn, Mahsa Ghasemi, Murat Cubuktepe, Georgios Bakirtzis
, Steven Carr, Mustafa O. Karabag, Cyrus Neary, Parham Gohari, Ufuk Topcu:
Formal Methods for Autonomous Systems. Found. Trends Syst. Control. 10(3-4): 180-407 (2023) - [j3]Mustafa O. Karabag, Melkior Ornik, Ufuk Topcu:
Exploiting Partial Observability for Optimal Deception. IEEE Trans. Autom. Control. 68(7): 4443-4450 (2023) - [c9]Mustafa O. Karabag, Ufuk Topcu:
On the Sample Complexity of Vanilla Model-Based Offline Reinforcement Learning with Dependent Samples. AAAI 2023: 8195-8202 - [c8]Apurva Patil, Mustafa O. Karabag, Takashi Tanaka, Ufuk Topcu:
Simulator-Driven Deceptive Control via Path Integral Approach. CDC 2023: 271-277 - [c7]Jingqi Li, Chih-Yuan Chiu, Lasse Peters, Fernando Palafox, Mustafa O. Karabag, Javier Alonso-Mora, Somayeh Sojoudi, Claire J. Tomlin, David Fridovich-Keil:
Scenario-Game ADMM: A Parallelized Scenario-Based Solver for Stochastic Noncooperative Games. CDC 2023: 8093-8099 - [c6]Bo Chen, Calvin Hawkins, Mustafa O. Karabag, Cyrus Neary, Matthew T. Hale, Ufuk Topcu:
Differential Privacy in Cooperative Multiagent Planning. UAI 2023: 347-357 - [i10]Bo Chen, Calvin Hawkins, Mustafa O. Karabag, Cyrus Neary, Matthew T. Hale, Ufuk Topcu:
Differential Privacy in Cooperative Multiagent Planning. CoRR abs/2301.08811 (2023) - [i9]Mustafa O. Karabag, Ufuk Topcu:
On the Sample Complexity of Vanilla Model-Based Offline Reinforcement Learning with Dependent Samples. CoRR abs/2303.04268 (2023) - [i8]Jingqi Li, Chih-Yuan Chiu, Lasse Peters, Fernando Palafox, Mustafa O. Karabag, Javier Alonso-Mora, Somayeh Sojoudi, Claire J. Tomlin, David Fridovich-Keil:
Scenario-Game ADMM: A Parallelized Scenario-Based Solver for Stochastic Noncooperative Games. CoRR abs/2304.01945 (2023) - [i7]Apurva Patil, Mustafa O. Karabag, Takashi Tanaka, Ufuk Topcu:
Simulator-Driven Deceptive Control via Path Integral Approach. CoRR abs/2308.14092 (2023) - [i6]Mustafa O. Karabag, Sophia Smith, David Fridovich-Keil, Ufuk Topcu:
Encouraging Inferable Behavior for Autonomy: Repeated Bimatrix Stackelberg Games with Observations. CoRR abs/2310.00468 (2023) - [i5]Tichakorn Wongpiromsarn, Mahsa Ghasemi, Murat Cubuktepe, Georgios Bakirtzis, Steven Carr, Mustafa O. Karabag, Cyrus Neary, Parham Gohari, Ufuk Topcu:
Formal Methods for Autonomous Systems. CoRR abs/2311.01258 (2023) - 2022
- [j2]Mustafa O. Karabag, Melkior Ornik, Ufuk Topcu:
Deception in Supervisory Control. IEEE Trans. Autom. Control. 67(2): 738-753 (2022) - [c5]Mustafa O. Karabag, David Fridovich-Keil, Ufuk Topcu:
Alternating Direction Method of Multipliers for Decomposable Saddle-Point Problems. Allerton 2022: 1-8 - [c4]Mustafa O. Karabag, Cyrus Neary, Ufuk Topcu:
Planning Not to Talk: Multiagent Systems that are Robust to Communication Loss. AAMAS 2022: 705-713 - [i4]Mustafa O. Karabag, Cyrus Neary, Ufuk Topcu:
Planning Not to Talk: Multiagent Systems that are Robust to Communication Loss. CoRR abs/2201.06619 (2022) - [i3]Yagiz Savas, Mustafa O. Karabag, Brian M. Sadler, Ufuk Topcu:
Deceptive Planning for Resource Allocation. CoRR abs/2206.01306 (2022) - [i2]Mustafa O. Karabag, David Fridovich-Keil, Ufuk Topcu:
Alternating Direction Method of Multipliers for Decomposable Saddle-Point Problems. CoRR abs/2209.04536 (2022) - 2021
- [c3]Mustafa O. Karabag, Cyrus Neary, Ufuk Topcu:
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles. AAAI 2021: 3815-3822 - [i1]Mustafa O. Karabag, Melkior Ornik, Ufuk Topcu:
Identity Concealment Games: How I Learned to Stop Revealing and Love the Coincidences. CoRR abs/2105.05377 (2021) - 2020
- [j1]Yagiz Savas, Melkior Ornik, Murat Cubuktepe, Mustafa O. Karabag, Ufuk Topcu:
Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints. IEEE Trans. Autom. Control. 65(4): 1552-1567 (2020)
2010 – 2019
- 2019
- [c2]Mustafa O. Karabag, Melkior Ornik, Ufuk Topcu:
Least Inferable Policies for Markov Decision Processes. ACC 2019: 1224-1231 - [c1]Mustafa O. Karabag, Melkior Ornik, Ufuk Topcu:
Optimal Deceptive and Reference Policies for Supervisory Control. CDC 2019: 1323-1330
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-09-26 01:52 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:
