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

S. Nageeb Ali

dblp:154/9987 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2025
0009-0008-2894-4712ORCID · reported

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

Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021Theory of computation · 3 · 3 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
3 papers
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
mechanism design
1.932025
From Design to Disclosure · EC 2025
Sequential Veto Bargaining with Incomplete Information · EC 2022
Voluntary Disclosure and Personalized Pricing · EC 2020
Algorithmic game theory and mechanism design › mechanism design
information design
0.912025
From Design to Disclosure · EC 2025
Algorithmic game theory and mechanism design › cooperative game theory
bargaining
0.612022
Sequential Veto Bargaining with Incomplete Information · EC 2022
Algorithmic game theory and mechanism design
incomplete information
0.612022
Sequential Veto Bargaining with Incomplete Information · EC 2022
Algorithmic game theory and mechanism design › pricing
personalized pricing
0.412020
Voluntary Disclosure and Personalized Pricing · EC 2020

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

information design · 1.3mechanism design · 0.6equilibrium analysis · 0.6
YearPublicationVenuePosition
2025 From Design to Disclosure
abstract
This paper studies games of voluntary disclosure in which a sender discloses evidence to a receiver who then offers an allocation and transfers. We characterize all equilibrium payoffs using information design as a tool. Our main result establishes that any payoff profile that can be achieved through information design can also be supported by an equilibrium of the disclosure game. Hence, our analysis suggests an equivalence between disclosure and design in this setting. We apply our results to monopoly pricing, trading financial assets, insurance markets, and policy negotiations.
S. Nageeb Ali, Andreas Kleiner
EC1
2022 Sequential Veto Bargaining with Incomplete Information
abstract
We study sequential bargaining between a proposer and a veto player. Both have single-peaked preferences, but the proposer is uncertain about the veto player's ideal point. The proposer cannot commit to future proposals. When players are patient, there can be equilibria with Coasian dynamics: the veto player's private information can largely nullify proposer's bargaining power. Our main result, however, is that there are also equilibria in which the proposer obtains the high payoff that he would with commitment power. The driving force is that the veto player's single-peaked preferences give the proposer an option to "leapfrog", i.e., to secure agreement from only low-surplus types early on to credibly extract surplus from high types later. Methodologically, we exploit the connection between sequential bargaining and static mechanism design.
S. Nageeb Ali, Navin Kartik, Andreas Kleiner
EC1
2020 Voluntary Disclosure and Personalized Pricing
S. Nageeb Ali, Greg Lewis, Shoshana Vasserman
EC1