default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArgyris Oikonomou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion. ICML 2024- [c6]Yang Cai, Xiangyu Liu, Argyris Oikonomou, Kaiqing Zhang:
Provable Partially Observable Reinforcement Learning with Privileged Information. NeurIPS 2024 - [c5]Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou, Katerina Sotiraki, Grigoris Velegkas, Manolis Zampetakis:
Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models. NeurIPS 2024 - [i10]Yingkai Li, Argyris Oikonomou:
Dynamics and Contracts for an Agent with Misspecified Beliefs. CoRR abs/2405.20423 (2024) - [i9]Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou, Katerina Sotiraki, Grigoris Velegkas, Manolis Zampetakis:
Injecting Undetectable Backdoors in Deep Learning and Language Models. CoRR abs/2406.05660 (2024) - [i8]Yixin Liu, Argyris Oikonomou, Weiqiang Zheng, Yang Cai, Arman Cohan:
COMAL: A Convergent Meta-Algorithm for Aligning LLMs with General Preferences. CoRR abs/2410.23223 (2024) - [i7]Yang Cai, Xiangyu Liu, Argyris Oikonomou, Kaiqing Zhang:
Provable Partially Observable Reinforcement Learning with Privileged Information. CoRR abs/2412.00985 (2024) - 2023
- [i6]Yang Cai
, Michael I. Jordan, Tianyi Lin, Argyris Oikonomou, Emmanouil V. Vlatakis-Gkaragkounis:
Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds. CoRR abs/2306.16617 (2023) - 2022
- [c4]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Finite-Time Last-Iterate Convergence for Learning in Multi-Player Games. NeurIPS 2022 - [c3]Yang Cai, Argyris Oikonomou, Mingfei Zhao:
Computing simple mechanisms: Lift-and-round over marginal reduced forms. STOC 2022: 704-717 - [i5]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Tight Last-Iterate Convergence of the Extragradient Method for Constrained Monotone Variational Inequalities. CoRR abs/2204.09228 (2022) - [i4]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Accelerated Algorithms for Monotone Inclusions and Constrained Nonconvex-Nonconcave Min-Max Optimization. CoRR abs/2206.05248 (2022) - 2021
- [c2]Yang Cai, Argyris Oikonomou:
On Simple Mechanisms for Dependent Items. EC 2021: 242-262 - [c1]Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao:
An Efficient ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. SODA 2021: 1337-1356 - [i3]Yang Cai, Argyris Oikonomou:
On Simple Mechanisms for Dependent Items. CoRR abs/2106.10814 (2021) - [i2]Yang Cai, Argyris Oikonomou, Mingfei Zhao:
Computing Simple Mechanisms: Lift-and-Round over Marginal Reduced Forms. CoRR abs/2111.03962 (2021)
2010 – 2019
- 2019
- [i1]Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao:
An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. CoRR abs/1911.10172 (2019)
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 2025-02-15 01:19 CET 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:
