default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos Martin
Person information
Other persons with a similar name
- Carlos González-Martín
- Carlos M. Lorenzetti (aka: Carlos Martín Lorenzetti)
- Carlos Martín
- Carlos Alberto Martín
- Juan Carlos Díaz Martín
- Carlos J. Martín-Dancausa (aka: Carlos J. Martín)
- Carlos Martín-Isla
- Carlos Martín-Vide
![[0000-0003-1670-6000]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-1670-6000")
— Rovira i Virgili University, Tarragona, Spain - Juan Carlos De Martin — Politecnico di Torino, DAUIN, Turin, Italy
- Carlos Otero (aka: Carlos M. Otero, Carlos Martin Otero)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i11]Carlos Martin, Tuomas Sandholm:
Solving Infinite-Player Games with Player-to-Strategy Networks. CoRR abs/2501.09330 (2025)- 2024
- [c3]Carlos Martin, Craig Boutilier, Ofer Meshi, Tuomas Sandholm:
Model-Free Preference Elicitation. IJCAI 2024: 3493-3503 - [i10]Carlos Martin, Tuomas Sandholm:
Simultaneous incremental support adjustment and metagame solving: An equilibrium-finding framework for continuous-action games. CoRR abs/2406.08683 (2024) - [i9]Carlos Martin, Tuomas Sandholm:
AlphaZeroES: Direct score maximization outperforms planning loss minimization. CoRR abs/2406.08687 (2024) - [i8]Carlos Martin, Tuomas Sandholm:
Joint-perturbation simultaneous pseudo-gradient. CoRR abs/2408.09306 (2024) - 2023
- [c2]Carlos Martin, Tuomas Sandholm:
Finding Mixed-Strategy Equilibria of Continuous-Action Games without Gradients Using Randomized Policy Networks. IJCAI 2023: 2844-2852 - [i7]Carlos Martin, Tuomas Sandholm:
Computing equilibria by minimizing exploitability with best-response ensembles. CoRR abs/2301.08830 (2023) - [i6]Carlos Martin, Tuomas Sandholm:
Planning in the imagination: High-level planning on learned abstract search spaces. CoRR abs/2308.08693 (2023) - 2022
- [i5]Carlos Martin, Tuomas Sandholm:
Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks. CoRR abs/2211.15936 (2022) - 2020
- [i4]Carlos Martin, Tuomas Sandholm:
Efficient exploration of zero-sum stochastic games. CoRR abs/2002.10524 (2020)
2010 – 2019
- 2017
- [j2]Carlos Martin:
Predicting the Large-Scale Evolution of Tag Systems: Code Supplement. Complex Syst. 26(1) (2017) - [i3]Carlos Martin:
Generation and analysis of lamplighter programs. CoRR abs/1707.02652 (2017) - [i2]Carlos Martin:
Differentiable cellular automata. CoRR abs/1708.09546 (2017) - 2016
- [j1]Carlos Martin:
Predicting the Large-Scale Evolution of Tag Systems. Complex Syst. 25(2) (2016) - [i1]Carlos Martin:
Predicting the large-scale evolution of tag systems. CoRR abs/1601.02014 (2016) - 2015
- [p1]Carlos Martin, David P. A. Corney, Ayse Göker:
Mining Newsworthy Topics from Social Media. Advances in Social Media Analysis 2015: 21-43 - 2014
- [c1]David P. A. Corney, Carlos Martin, Ayse Göker:
Two Sides to Every Story: Subjective Event Summarization of Sports Events using Twitter. SoMuS@ICMR 2014
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-24 21:35 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:
