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

Junya Zhou

dblp:392/2961 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0001-1361-2247ORCID · reported

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 › information exchange
cheap talk
0.812024
Complexity, Communication and Misrepresentation · EC 2024
Algorithmic game theory and mechanism design › mechanism design
information design
0.812024
Complexity, Communication and Misrepresentation · EC 2024
Algorithmic game theory and mechanism design › imperfect information games
strategic communication
0.812024
Complexity, Communication and Misrepresentation · EC 2024

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

game-theoretic analysis · 0.8behavioral economics · 0.8
YearPublicationVenuePosition
2024 Complexity, Communication and Misrepresentation
abstract
We investigate how increasing the complexity of the message space, in the presence of limited memory, can reduce misrepresentation in strategic communication. We enrich a standard cheap talk game so that senders must communicate not just a payoff-relevant state, but also payoff-irrelevant attributes correlated with the state. We show that: i) increasing the set of attributes that may need to be reported (i.e., the complexity of the game) improves the amount of information transmitted in equilibrium, ii) too much of an increase in complexity leads to a reversal of those gains, iii) limited memory on the part of players, as well as the relative complexity faced by senders and receivers, drives these changes, and iv) individuals experience cognitive costs when dealing with complex environments that they are willing to pay to avoid. Our findings demonstrate that the reporting of redundant information may induce equilibria that feature improved outcomes compared to simpler, more direct reporting systems, and point out the importance of complexity when trying to induce truthful information revelation.
Junya Zhou, Collin Raymond
EC1