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.

Ian Ball

dblp:243/2554 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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%
Artificial intelligence
1 paper
Multi-agent systems · 100%
Network and information security
1 paper
Network security · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design › contract theory
moral hazard
0.212023
Should the Timing of Inspections be Predictable? · EC 2023
Algorithmic game theory and mechanism design › mechanism design › contract theory
principal-agent problem
0.212023
Should the Timing of Inspections be Predictable? · EC 2023

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

game theory · 2.3equilibrium analysis · 2.3game-theoretic modeling · 0.7
YearPublicationVenuePosition
2024 Content Filtering with Inattentive Information Consumers
abstract
We develop a model of content filtering as a game between the filter and the content consumer, where the latter incurs information costs for examining the content. Motivating examples include censoring misinformation, spam/phish filtering, and recommender systems acting on a stream of content. When the attacker is exogenous, we show that improving the filter’s quality is weakly Pareto improving, but has no impact on equilibrium payoffs until the filter becomes sufficiently accurate. Further, if the filter does not internalize the consumer’s information costs, its lack of commitment power may render it useless and lead to inefficient outcomes. When the attacker is also strategic, improvements in filter quality may decrease equilibrium payoffs.
Ian Ball, James W. Bono, Justin Grana, Nicole Immorlica, Brendan Lucier, Aleksandrs Slivkins
AAAI1
2023 Should the Timing of Inspections be Predictable?
abstract
Inspections are frequently conducted to reveal information about agents' otherwise unobserved actions. Some inspections occur at pre-announced times; others are surprises. We show how the productive role of the inspected agent determines whether predictable or random inspections are optimal. If the agent's main task is achieving a breakthrough---think of an entrepreneur investing in an innovative industry---then predictable inspections are optimal. If the main task is avoiding a breakdown---think of a financial institution managing its risk in order to avoid default---then random inspections are optimal.
Ian Ball, Jan Knoepfle
EC1