default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClayton Thomas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Yannai A. Gonczarowski
, Clayton Thomas:
Structural Complexities of Matching Mechanisms. STOC 2024: 455-466- [i11]Clayton Thomas:
Priority-Neutral Matching Lattices Are Not Distributive. CoRR abs/2404.02142 (2024) - [i10]Shiri Ron, Clayton Thomas, S. Matthew Weinberg, Qianfan Zhang:
Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier. CoRR abs/2409.08241 (2024) - [i9]Yannai A. Gonczarowski, Ori Heffetz, Guy Ishai, Clayton Thomas:
Describing Deferred Acceptance and Strategyproofness to Participants: Experimental Analysis. CoRR abs/2409.18166 (2024) - 2023
- [b1]Clayton Thomas:
Explainable Mechanism Design. Princeton University, USA, 2023 - [c7]Yannai A. Gonczarowski, Ori Heffetz, Clayton Thomas:
Strategyproofness-Exposing Mechanism Descriptions. EC 2023: 782 - 2022
- [c6]Linda Cai, Clayton Thomas:
The Short-Side Advantage in Random Matching Markets. SOSA 2022: 257-267 - [i8]Yannai A. Gonczarowski, Ori Heffetz, Clayton Thomas:
Strategyproofness-Exposing Mechanism Descriptions. CoRR abs/2209.13148 (2022) - [i7]Yannai A. Gonczarowski, Clayton Thomas:
On the Complexities of Understanding Matching Mechanisms. CoRR abs/2212.08709 (2022) - 2021
- [c5]Itai Ashlagi, Mark Braverman, Amin Saberi, Clayton Thomas, Geng Zhao:
Tiered Random Matching Markets: Rank Is Proportional to Popularity. ITCS 2021: 46:1-46:16 - [c4]Clayton Thomas:
Classification of Priorities Such That Deferred Acceptance is OSP Implementable. EC 2021: 860 - [c3]Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao:
Exponential communication separations between notions of selfishness. STOC 2021: 947-960 - 2020
- [c2]Linda Cai, Clayton Thomas, S. Matthew Weinberg:
Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard. ITCS 2020: 61:1-61:32 - [i6]Itai Ashlagi, Mark Braverman, Clayton Thomas, Geng Zhao:
Tiered Random Matching Markets: Rank is Proportional to Popularity. CoRR abs/2009.05124 (2020) - [i5]Clayton Thomas:
Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof. CoRR abs/2011.12367 (2020) - [i4]Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao:
Exponential Communication Separations between Notions of Selfishness. CoRR abs/2012.14898 (2020)
2010 – 2019
- 2019
- [i3]Linda Cai, Clayton Thomas, S. Matthew Weinberg:
Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms when Demand Queries are NP-hard. CoRR abs/1910.04342 (2019) - [i2]Linda Cai, Clayton Thomas:
Representing All Stable Matchings by Walking a Maximal Chain. CoRR abs/1910.04401 (2019) - [i1]Linda Cai, Clayton Thomas:
The Short-Side Advantage in Random Matching Markets. CoRR abs/1910.04406 (2019) - 2017
- [c1]Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu:
Maximally recoverable codes: The bounded case. Allerton 2017: 1115-1122
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-10-22 21:19 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:
