default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancisco J. Marmolejo Cossío
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i13]David Huang, Francisco J. Marmolejo Cossío, Edwin Lock, David C. Parkes:
Accelerated Preference Elicitation with LLM-Based Proxies. CoRR abs/2501.14625 (2025)- 2024
- [j7]Simon Finster, Michelle González Amador, Edwin Lock, Francisco J. Marmolejo Cossío, Evi Micha, Ariel D. Procaccia:
Welfare-Maximizing Pooled Testing. SIGecom Exch. 22(1): 66-73 (2024) - [c13]Aggelos Kiayias, Elias Koutsoupias, Francisco J. Marmolejo Cossío, Aikaterini-Panagiota Stouka:
Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies. SAGT 2024: 333-350 - [i12]Aggelos Kiayias, Elias Koutsoupias, Francisco J. Marmolejo Cossío, Aikaterini-Panagiota Stouka:
Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies. CoRR abs/2407.08686 (2024) - 2023
- [c12]Zhou Fan, Francisco J. Marmolejo Cossío, Daniel J. Moroz, Michael Neuder, Rithvik Rao, David C. Parkes:
Strategic Liquidity Provision in Uniswap V3. AFT 2023: 25:1-25:22 - [c11]Simon Finster
, Michelle González Amador, Edwin Lock, Francisco J. Marmolejo Cossío, Evi Micha, Ariel D. Procaccia:
Welfare-Maximizing Pooled Testing. EC 2023: 699 - [i11]Luis Alejandro Benavides-Vázquez, Héctor Alonso Guzmán-Gutiérrez, Jakob Jonnerby, Philip Lazos, Edwin Lock, Francisco J. Marmolejo Cossío, Ninad Rajgopal, José Roberto Tello-Ayala:
Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19. CoRR abs/2306.17191 (2023) - 2022
- [j6]Edwin Lock, Paul W. Goldberg, Francisco J. Marmolejo Cossío:
Learning Strong Substitutes Demand via Queries. ACM Trans. Economics and Comput. 10(2): 10:1-10:22 (2022) - [c10]Zhou Fan, Francisco J. Marmolejo Cossío, Ben Altschuler, He Sun, Xintong Wang, David C. Parkes:
Differential Liquidity Provision in Uniswap v3 and Implications for Contract Design✱. ICAIF 2022: 9-17 - [c9]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío:
Decentralized Update Selection with Semi-strategic Experts. SAGT 2022: 403-420 - [i10]Zhou Fan, Francisco J. Marmolejo Cossío, Ben Altschuler, He Sun, Xintong Wang, David C. Parkes:
Differential Liquidity Provision in Uniswap v3 and Implications for Contract Design. CoRR abs/2204.00464 (2022) - [i9]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío:
Decentralised Update Selection with Semi-Strategic Experts. CoRR abs/2205.08407 (2022) - [i8]Edwin Lock, Francisco J. Marmolejo Cossío, Evi Micha, Ariel D. Procaccia:
Welfare-Maximizing Pooled Testing. CoRR abs/2206.10660 (2022) - 2021
- [j5]Francisco J. Marmolejo Cossío, Faidra Monachou:
Novel practices and highlights from the Fourth Workshop on Mechanism Design for Social Good. AI Matters 7(1): 26-34 (2021) - [j4]Salvador Ruiz-Correa, Rubén López-Revilla, Fernando Díaz-Barriga, Francisco J. Marmolejo Cossío, Viridiana del Carmen Robledo-Valero, Emilio Ernesto Hernandez-Huerfano, Leonardo Alvarez-Rivera, Mónica Liliana Rangel-Martínez, Miguel Ángel Lutzow-Steiner, Luis Alfredo Ortiz-Vázquez, Andrea Rebeca Mendoza-Lara, Montserrat Olivo-Rodríguez, Marco Sebastián Galván-Ramírez, Ángel Emanuel Morales-Neri, Víctor Uriel Martínez-Donjuan, Massiel Isabella Cervantes-Irurzo, Andreu Comas-García, Fernando Hernández-Maldonado, Carlos Aguilar-Acosta:
Health Sentinel: A mobile crowdsourcing platform for self-reported surveys provides early detection of COVID-19 clusters in San Luis Potosí, Mexico. Int. J. Medical Informatics 153: 104508 (2021) - [j3]Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris:
Optimally Deceiving a Learning Leader in Stackelberg Games. J. Artif. Intell. Res. 72: 507-531 (2021) - [j2]Paul W. Goldberg, Francisco J. Marmolejo Cossío:
Learning Convex Partitions and Computing Game-theoretic Equilibria from Best-response Queries. ACM Trans. Economics and Comput. 9(1): 3:1-3:36 (2021) - [c8]Philip Lazos, Francisco J. Marmolejo Cossío, Xinyu Zhou, Jonathan Katz:
RPPLNS: Pay-per-last-N-shares with a Randomised Twist. AAMAS 2021: 1569-1571 - [c7]Edwin Lock, Francisco Javier Marmolejo Cossío, Jakob Jonnerby, Ninad Rajgopal, Héctor Alonso Guzmán-Gutiérrez, Luis Alejandro Benavides-Vázquez, José Roberto Tello-Ayala, Philip Lazos:
Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19✱. EAAMO 2021: 12:1-12:9 - [i7]Philip Lazos, Francisco J. Marmolejo Cossío, Xinyu Zhou, Jonathan Katz:
RPPLNS: Pay-per-last-N-shares with a Randomised Twist. CoRR abs/2102.07681 (2021) - 2020
- [b1]Francisco J. Marmolejo Cossío:
Equilibrium computation in games and strategic aspects of bitcoin mining. University of Oxford, UK, 2020 - [c6]Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo Cossío:
Fairness and Efficiency in DAG-Based Cryptocurrencies. Financial Cryptography 2020: 79-96 - [c5]Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris:
Optimally Deceiving a Learning Leader in Stackelberg Games. NeurIPS 2020 - [c4]Paul W. Goldberg, Edwin Lock, Francisco J. Marmolejo Cossío:
Learning Strong Substitutes Demand via Queries. WINE 2020: 401-415 - [i6]Paul W. Goldberg, Edwin Lock, Francisco J. Marmolejo Cossío:
Learning Strong Substitutes Demand via Queries. CoRR abs/2005.01496 (2020) - [i5]Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris:
Optimally Deceiving a Learning Leader in Stackelberg Games. CoRR abs/2006.06566 (2020)
2010 – 2019
- 2019
- [j1]Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu:
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. Theory Comput. Syst. 63(1): 26-53 (2019) - [c3]Francisco J. Marmolejo Cossío, Eric Brigham, Benjamin Sela, Jonathan Katz:
Competing (Semi-)Selfish Miners in Bitcoin. AFT 2019: 89-109 - [i4]Francisco J. Marmolejo Cossío, Eric Brigham, Benjamin Sela, Jonathan Katz:
Competing (Semi)-Selfish Miners in Bitcoin. CoRR abs/1906.04502 (2019) - [i3]Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo Cossío:
Fairness and Efficiency in DAG-based Cryptocurrencies. CoRR abs/1910.02059 (2019) - 2018
- [c2]Paul W. Goldberg, Francisco J. Marmolejo Cossío:
Learning Convex Partitions and Computing Game-Theoretic Equilibria from Best Response Queries. WINE 2018: 168-187 - [i2]Paul W. Goldberg, Francisco J. Marmolejo Cossío:
Learning Convex Partitions and Computing Game-theoretic Equilibria from Best Response Queries. CoRR abs/1807.06170 (2018) - 2016
- [c1]Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu:
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. SAGT 2016: 3-14 - [i1]Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu:
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. CoRR abs/1610.08906 (2016)
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-03-04 21:11 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:
