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

Teddy Mekonnen

dblp:410/3716 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0001-9759-5407ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Theory of computation · 2 · 1 first-author · 2 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
2 papers
Algorithmic game theory and mechanism design · 79% Information theory · 13% Approximation and online algorithms · 4%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
contract theory
0.912025
Competition, Persuasion, and Search · EC 2025
Algorithmic game theory and mechanism design
fair division
0.912025
Diversity in Choice as Majorization · EC 2025
Information theory
majorization
0.912025
Diversity in Choice as Majorization · EC 2025
Algorithmic game theory and mechanism design › matching
matching theory
0.912025
Diversity in Choice as Majorization · EC 2025
Algorithmic game theory and mechanism design
mechanism design
0.912025
Competition, Persuasion, and Search · EC 2025
Algorithmic game theory and mechanism design › mechanism design › contract theory
repeated contracting
0.912025
Competition, Persuasion, and Search · EC 2025
Algorithmic game theory and mechanism design › market design › matching markets
school choice
0.912025
Diversity in Choice as Majorization · EC 2025
Approximation and online algorithms
online selection
0.312025
Competition, Persuasion, and Search · EC 2025
Algorithms and data structures › search algorithms
sequential search
0.312025
Competition, Persuasion, and Search · EC 2025

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

stopping game analysis · 0.9principal-agent modeling · 0.9majorization theory · 0.9
YearPublicationVenuePosition
2025 Diversity in Choice as Majorization
abstract
This paper introduces a novel framework for modeling diversity using the theory of majorization and applies it to school choice problems. We consider a school with limited capacity that must select students from an applicant pool, where each student is classified into types (e.g., by race, gender, or socioeconomic status). Within this setting, we ask: How should we compare the diversity of student groups? And what admissions procedure balance the school's goal of admitting students with the highest priority (e.g., academic merit, proximity to the school) and achieving a diverse student body?
Federico Echenique, Teddy Mekonnen, M. Bumin Yenmez
EC2
2025 Competition, Persuasion, and Search
abstract
An agent engages in sequential search. He does not directly observe the quality of the goods he samples, but he can purchase signals designed by profit maximizing principal(s). We formulate the principal-agent relationship as a repeated contracting problem within a stopping game, and characterize the set of equilibrium payoffs. We show that when the agent's search cost falls below a given threshold, competition does not impact how much surplus is generated in equilibrium nor how the surplus is divided. In contrast, competition benefits the agent at the expense of total surplus when the search cost exceeds that threshold. Our results challenge the view that monopoly decreases market efficiency, and moreover, suggest that it leads to more information provision than does competition.
Teddy Mekonnen, Bobak Pakzad-Hurson
EC1