default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatheus V. X. Ferreira
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Tarun Chitra, Matheus V. X. Ferreira, Kshitij Kulkarni:
Credible, Optimal Auctions via Public Broadcast. AFT 2024: 19:1-19:16- [i10]Matheus V. X. Ferreira, Aadityan Ganesh, Jack Hourigan, Hannah Huh, S. Matthew Weinberg, Catherine Yu:
Computing Optimal Manipulations in Cryptographic Self-Selection Proof-of-Stake Protocols. CoRR abs/2406.15282 (2024) - 2023
- [c8]Matheus Venturyne Xavier Ferreira, David C. Parkes:
Credible Decentralized Exchange Design via Verifiable Sequencing Rules. STOC 2023: 723-736 - [i9]Tarun Chitra, Matheus V. X. Ferreira, Kshitij Kulkarni:
Credible, Optimal Auctions via Blockchains. CoRR abs/2301.12532 (2023) - [i8]Tarun Chitra, Matheus V. X. Ferreira, Kshitij Kulkarni:
Credible, Optimal Auctions via Blockchains. IACR Cryptol. ePrint Arch. 2023: 114 (2023) - 2022
- [c7]Meryem Essaidi, Matheus V. X. Ferreira, S. Matthew Weinberg
:
Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions. ITCS 2022: 66:1-66:19 - [c6]Matheus V. X. Ferreira, Ye Lin Sally Hahn, S. Matthew Weinberg, Catherine Yu:
Optimal Strategic Mining Against Cryptographic Self-Selection in Proof-of-Stake. EC 2022: 89-114 - [i7]Meryem Essaidi, Matheus V. X. Ferreira, S. Matthew Weinberg:
Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributions. CoRR abs/2205.14758 (2022) - [i6]Matheus V. X. Ferreira, Ye Lin Sally Hahn, S. Matthew Weinberg, Catherine Yu:
Optimal Strategic Mining Against Cryptographic Self-Selection in Proof-of-Stake. CoRR abs/2207.07996 (2022) - [i5]Matheus V. X. Ferreira, David C. Parkes:
Credible Decentralized Exchange Design via Verifiable Sequencing Rules. CoRR abs/2209.15569 (2022) - 2021
- [b1]Matheus Venturyne Xavier Ferreira:
Economics and Computation in Decentralized Systems. Princeton University, USA, 2021 - [c5]Matheus V. X. Ferreira, Daniel J. Moroz, David C. Parkes, Mitchell Stern:
Dynamic posted-price mechanisms for the blockchain transaction-fee market. AFT 2021: 86-99 - [c4]Matheus V. X. Ferreira, S. Matthew Weinberg:
Proof-of-Stake Mining Games with Perfect Randomness. EC 2021: 433-453 - [c3]Matheus V. X. Ferreira, Daniel J. Moroz, David C. Parkes, Mitchell Stern:
Dynamic Posted-Price Mechanisms for the Blockchain Transaction Fee Market (Invited Talk). Tokenomics 2021: 6:1-6:1 - [i4]Matheus V. X. Ferreira, Daniel J. Moroz, David C. Parkes, Mitchell Stern:
Dynamic Posted-Price Mechanisms for the Blockchain Transaction-Fee Market. CoRR abs/2103.14144 (2021) - [i3]Matheus V. X. Ferreira, S. Matthew Weinberg:
Proof-of-Stake Mining Games with Perfect Randomness. CoRR abs/2107.04069 (2021) - 2020
- [c2]Matheus V. X. Ferreira, S. Matthew Weinberg:
Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments. EC 2020: 683-712 - [i2]Matheus V. X. Ferreira, S. Matthew Weinberg:
Credible, Truthful, and Bounded-Round Mechanisms via Cryptographic Commitments. CoRR abs/2004.01598 (2020)
2010 – 2019
- 2019
- [c1]Matheus Xavier Ferreira, S. Matthew Weinberg, Danny Yuxing Huang, Nick Feamster, Tithi Chattopadhyay:
Selling a Single Item with Negative Externalities. WWW 2019: 196-206 - [i1]Tithi Chattopadhyay, Nick Feamster, Matheus V. X. Ferreira, Danny Yuxing Huang, S. Matthew Weinberg:
Selling a Single Item with Negative Externalities. CoRR abs/1902.10008 (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 2024-09-18 00:16 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:
