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

Ohad Einav

dblp:380/7694 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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%
Artificial intelligence
2 papers
Deep learning architectures and training · 79% Language models and text generation · 21%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › training objective
training objective design
0.912025
A Market for Accuracy: Classification Under Competition · ICML 2025
Algorithmic game theory and mechanism design › mechanism design
contract design
0.812024
Incentivizing Quality Text Generation via Statistical Contracts · NeurIPS 2024
Algorithmic game theory and mechanism design › mechanism design › contract theory
moral hazard
0.812024
Incentivizing Quality Text Generation via Statistical Contracts · NeurIPS 2024
Algorithmic game theory and mechanism design › mechanism design › contract theory
principal-agent problem
0.812024
Incentivizing Quality Text Generation via Statistical Contracts · NeurIPS 2024

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

equilibrium analysis · 1.7contract theory · 1.5composite hypothesis testing · 1.5
YearPublicationVenuePosition
2025 A Market for Accuracy: Classification Under Competition
abstract
Machine learning models play a key role for service providers looking to gain market share in consumer markets. However, traditional learning approaches do not take into account the existence of additional providers, who compete with each other for consumers. Our work aims to study learning in this market setting, as it affects providers, consumers, and the market itself. We begin by analyzing such markets through the lens of the learning objective, and show that accuracy cannot be the only consideration. We then propose a method for classification under competition, so that a learner can maximize market share in the presence of competitors. We show that our approach benefits the providers as well as the consumers, and find that the timing of market entry and model updates can be crucial. We display the effectiveness of our approach across a range of domains, from simple distributions to noisy datasets, and show that the market as a whole remains stable by converging quickly to an equilibrium.
Ohad Einav, Nir Rosenfeld
ICML1
2024 Incentivizing Quality Text Generation via Statistical Contracts
abstract
While the success of large language models (LLMs) increases demand for machine-generated text, current pay-per-token pricing schemes create a misalignment of incentives known in economics as moral hazard: Text-generating agents have strong incentive to cut costs by preferring a cheaper model over the cutting-edge one, and this can be done “behind the scenes” since the agent performs inference internally. In this work, we approach this issue from an economic perspective, by proposing a pay-for-performance, contract-based framework for incentivizing quality. We study a principal-agent game where the agent generates text using costly inference, and the contract determines the principal’s payment for the text according to an automated quality evaluation. Since standard contract theory is inapplicable when internal inference costs are unknown, we introduce cost-robust contracts. As our main theoretical contribution, we characterize optimal cost-robust contracts through a direct correspondence to optimal composite hypothesis tests from statistics, generalizing a result of Saig et al. (NeurIPS’23). We evaluate our framework empirically by deriving contracts for a range of objectives and LLM evaluation benchmarks, and find that cost-robust contracts sacrifice only a marginal increase in objective value compared to their cost-aware counterparts.
Eden Saig, Ohad Einav, Inbal Talgam-Cohen
NeurIPS2