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

Steven Tadelis

dblp:149/6331 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0001-8864-8052ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 since 2021Theory of computation · 3 · 1 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

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%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational finance and economics · 50% Computational social science and digital humanities · 50%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 79% Recommender systems · 21%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › cooperative game theory
bargaining
0.512021
Communication and Bargaining Breakdown: An Empirical Analysis · EC 2021
Information retrieval › user behavior
search behavior
0.212016
Returns to Consumer Search: Evidence from eBay · EC 2016
Algorithmic game theory and mechanism design
consumer search
0.212016
Returns to Consumer Search: Evidence from eBay · EC 2016
Natural language and speech › Information extraction and text analysis
sentiment analysis
0.212015
Canary in the e-Commerce Coal Mine: Detecting and Predicting Poor Experiences Using Buyer-to-Seller Messages · EC 2015
Computational finance and economics › platform economics
online marketplace analysis
0.212015
Canary in the e-Commerce Coal Mine: Detecting and Predicting Poor Experiences Using Buyer-to-Seller Messages · EC 2015
Algorithmic game theory and mechanism design › mechanism design
auction design
0.212015
Is Sniping A Problem For Online Auction Markets? · WWW 2015
Algorithmic game theory and mechanism design › auction theory
online auction
0.212015
Is Sniping A Problem For Online Auction Markets? · WWW 2015
Recommender systems › user modeling
user behavior prediction
0.112015
Canary in the e-Commerce Coal Mine: Detecting and Predicting Poor Experiences Using Buyer-to-Seller Messages · EC 2015

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

text classification · 0.7logistic regression · 0.7text analysis · 0.5structural model · 0.5empirical analysis · 0.5difference-in-differences · 0.5instrumental variables estimation · 0.4causal inference · 0.4
YearPublicationVenuePosition
2021 Communication and Bargaining Breakdown: An Empirical Analysis
abstract
Bargaining breakdown plagues bargaining in environments with incomplete information. Does communication help or harm? On May 23, 2016, eBay Germany's Best Offer platform introduced unstructured communication allowing desktop users, but not the mobile users, to accompany offers with a message. Using this natural experiment, our difference-in-differences approach documents a 14% decrease in the the rate of breakdown among compliers. Though adoption is immediate, the effect is not. We show, using text analysis, that the dynamics are consistent with repeat players learning how to use communication in bargaining, and that the messaging strategies of experienced sellers are correlated with successful bargaining.
Matt Backus, Thomas Blake, Jett Pettus, Steven Tadelis
EC4
2016 Returns to Consumer Search: Evidence from eBay
abstract
A growing body of empirical literature finds that consumers are relatively limited in how much they search over product characteristics. We assemble a dataset of search and purchase behavior from eBay to quantify the returns, and thus implied costs, to consumer search on the internet. The extensive nature of the eBay data allows us to examine a rich and detailed set of questions related to search in a way that previous structural models cannot. In contrast to the literature, we find that consumers search a lot: on average 36 times per purchase over 3 (distinct) days, with most sessions ending in no purchase. We find that search costs are relatively low, in the region of 25 cents per search page. We pursue the analysis further by, i) examining how users refine their search, ii) how search behavior spans multiple search sessions, and iii) how the amount of search relates to finding lower prices.
Thomas Blake, Chris Nosko, Steven Tadelis
EC3
2015 Canary in the e-Commerce Coal Mine: Detecting and Predicting Poor Experiences Using Buyer-to-Seller Messages
abstract
Reputation and feedback systems in online marketplaces are often biased, making it difficult to ascertain the quality of sellers. We use post-transaction, buyer-to-seller message traffic to detect signals of unsatisfactory transactions on eBay. We posit that a message sent after the item was paid for serves as a reliable indicator that the buyer may be unhappy with that purchase, particularly when the message included words associated with a negative experience. The fraction of a seller's message traffic that was negative predicts whether a buyer who transacts with this seller will stop purchasing on eBay, implying that platforms can use these messages as an additional signal of seller quality.
Dimitriy V. Masterov, Uwe F. Mayer, Steven Tadelis
EC3
2015 Is Sniping A Problem For Online Auction Markets?
abstract
A common complaint about online auctions for consumer goods is the presence of ``snipers,'' who place bids in the final seconds of sequential ascending auctions with predetermined ending times. The literature conjectures that snipers are best-responding to the existence of ``incremental" bidders that bid up to their valuation only as they are outbid. Snipers aim to catch these incremental bidders at a price below their reserve, with no time to respond. As a consequence, these incremental bidders may experience regret when they are outbid at the last moment at a price below their reservation value. We measure the effect of this experience on a new buyer's propensity to participate in future auctions. We show the effect to be causal using a carefully selected subset of auctions from eBay.com and instrumental variables estimation strategy. Bidders respond to sniping quite strongly and are between 4 and 18 percent less likely to return to the platform.
Matt Backus, Thomas Blake, Dimitriy V. Masterov, Steven Tadelis
WWW4