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.

Battal Dogan

dblp:159/8767 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · conflict

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 · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › matching
stable matching
1.022024
When Geography Shapes Preferences: Redesigning Teacher Assignment in Italy · EC 2024
Existence of Myopic-Farsighted Stable Sets in Matching Markets · EC 2023
Algorithmic game theory and mechanism design › matching › matching mechanism
deferred acceptance
0.812024
When Geography Shapes Preferences: Redesigning Teacher Assignment in Italy · EC 2024
Algorithmic game theory and mechanism design › matching
matching theory
0.812024
When Geography Shapes Preferences: Redesigning Teacher Assignment in Italy · EC 2024
Algorithmic game theory and mechanism design › social choice › voting
tie-breaking rule
0.812024
When Geography Shapes Preferences: Redesigning Teacher Assignment in Italy · EC 2024
Algorithmic game theory and mechanism design › matching › matching under preferences
many-to-one matching
0.712023
Existence of Myopic-Farsighted Stable Sets in Matching Markets · EC 2023
Algorithmic game theory and mechanism design › market design
matching markets
0.712023
Existence of Myopic-Farsighted Stable Sets in Matching Markets · EC 2023
Algorithmic game theory and mechanism design › matching
stability concept
0.712023
Existence of Myopic-Farsighted Stable Sets in Matching Markets · EC 2023

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

mechanism design · 0.8empirical analysis · 0.8stability analysis · 0.7game theory · 0.7
YearPublicationVenuePosition
2024 When Geography Shapes Preferences: Redesigning Teacher Assignment in Italy
abstract
We investigate Italy's centralized teacher assignment system where teachers can rank "geographical regions", leading to ties in their rank order lists (ROLs). We show that the way ties in teachers' ROLs are resolved in the current assignment mechanism systematically violates teachers' priority rights and results in justified envy. We provide a practical solution to this problem. We introduce a new assignment mechanism called Deferred Acceptance with Hierarchical Choice (DA-HC), which is strategy-proof, eliminates justified envy, and Pareto improves over the benchmark deferred acceptance mechanism with simple tie-breaking (DA-STB). We show that two commonly used efficiency notions from the literature, Pareto efficiency subject to eliminating justified envy and size efficiency subject to eliminating justified envy, do not apply effectively in this context as they are not compatible with strategy-proofness. We introduce a new efficiency concept and show that the DA-HC mechanism is optimal in efficiency terms within the class of strategy-proof mechanisms that eliminate justified envy. Using administrative data, we provide evidence that our proposed mechanism can potentially bring significant welfare improvements over the benchmark DA-STB.
Mariagrazia Cavallo, Battal Dogan
EC2
2023 Existence of Myopic-Farsighted Stable Sets in Matching Markets
abstract
We consider decentralized one-to-one matching markets with myopic and farsighted agents. We study myopic-farsighted stable sets that are internally and externally stable when myopic agents only care about their immediate payoffs, while farsighted agents take into account further possible reactions and care about their long-run payoffs when considering possible deviations. We constructively prove the existence of myopic-farsighted stable sets for any problem where there are farsighted agents only on one side of the market, while there may be myopic agents on both sides. We prove that a myopic-farsighted stable set may not exist when there are farsighted agents on both sides of the market and there is at least one myopic agent. Our analysis is in contrast to the earlier literature which considers only the extreme cases where either all agents are myopic, or all agents are farsighted, or all agents on one side are myopic and all agents on the other side are farsighted. Our results have several implications pertaining to core-stability and singleton stable sets, and yield numerous results from the literature as immediate corollaries. Finally, we extend several results to weakly stable sets and to many-to-one matching markets.
Battal Dogan, Lars Ehlers
EC1