Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jiangtao Li 0004

dblp:62/6011-4 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0002-5360-9528ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
bounded rationality
0.512021
Are Simple Mechanisms Optimal when Agents are Unsophisticated? · EC 2021
Algorithmic game theory and mechanism design
mechanism design
0.512021
Are Simple Mechanisms Optimal when Agents are Unsophisticated? · EC 2021
Algorithmic game theory and mechanism design › mechanism design
simple mechanisms
0.112021
Are Simple Mechanisms Optimal when Agents are Unsophisticated? · EC 2021

Methods — techniques the papers use, named apart from their topics

strategic sophistication models · 0.5game theory · 0.5
YearPublicationVenuePosition
2021 Are Simple Mechanisms Optimal when Agents are Unsophisticated?
abstract
We study the design of mechanisms involving agents that have limited strategic sophistication. We define a mechanism to be simple if—given the assumed level of strategic sophistication—agents can determine their optimal strategy. We examine whether it is optimal for the mechanism designer who faces strategically unsophisticated agents to offer a simple mechanism. We show that when the designer uses a mechanism that is not simple, while she loses the ability to predict play, she may nevertheless be better off no matter how agents resolve their strategic confusion.
Jiangtao Li 0004, Piotr Dworczak
EC1