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

Shota Ichihashi

dblp:248/9068 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0001-6812-282XORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Theory of computation · 2 · 2 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
2 papers
Algorithmic game theory and mechanism design · 100%
Network and information security
1 paper
Privacy and data protection · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
consumer privacy
0.412020
Dynamic Privacy Choices · EC 2020
Algorithmic game theory and mechanism design › market dynamics
platform competition
0.112020
Dynamic Privacy Choices · EC 2020

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

mechanism design · 1.7dynamic model · 0.9
YearPublicationVenuePosition
2025 Buyer-Optimal Algorithmic Recommendations
abstract
We study how recommendation algorithms affect trade and welfare in markets characterized by algorithmic consumption, such as e-commerce platforms and AI assistants. Our analysis begins with a model of bilateral trade in which a single product is exchanged between a buyer and a seller under uncertainty about product value and seller cost. An algorithm recommends the product based on its price and estimated buyer value, thereby steering purchasing decisions. We characterize the buyer-optimal algorithm and show that it deliberately biases recommendations to amplify buyer price sensitivity, inducing lower seller prices. This optimal algorithm strategically deviates from the ex post optimal rule to exploit price pressure and enhance buyer surplus.
Shota Ichihashi, Alex Smolin
EC1
2020 Dynamic Privacy Choices
abstract
I study a dynamic model of consumer privacy and platform data collection. In each period, consumers choose their level of platform activity. Greater activity generates more precise information about the consumer, thereby increasing platform profits. Although consumers value privacy, a platform is able to collect much information by gradually lowering the level of privacy protection. In the long-run, consumers become "addicted" to the platform, whereby they lose privacy and receive low payoffs, but continue to choose high activity levels. Competition is unhelpful because consumers have a higher incentive to use a platform to which they have lower privacy.
Shota Ichihashi
EC1