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

Michael Grubb

dblp:130/6568 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 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%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
auction design
0.212013
Peaches, lemons, and cookies: designing auction markets with dispersed information · EC 2013
Algorithmic game theory and mechanism design › mechanism design › auction design
common value auction
0.212013
Peaches, lemons, and cookies: designing auction markets with dispersed information · EC 2013
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
equilibrium refinement
0.212013
Peaches, lemons, and cookies: designing auction markets with dispersed information · EC 2013
Algorithmic game theory and mechanism design › mechanism design
information asymmetry
0.212013
Peaches, lemons, and cookies: designing auction markets with dispersed information · EC 2013
Algorithmic game theory and mechanism design › mechanism design › auction design
revenue-maximizing auction
0.212013
Peaches, lemons, and cookies: designing auction markets with dispersed information · EC 2013
Algorithmic game theory and mechanism design › mechanism design › auction design
ad auction
0.012013
Peaches, lemons, and cookies: designing auction markets with dispersed information · EC 2013

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

game theory · 0.2equilibrium refinement · 0.2
YearPublicationVenuePosition
2025 Modeling decision-making under uncertainty with qualitative outcomes
abstract
Modeling decision-making under uncertainty typically relies on quantitative outcomes. Many decisions, however, are qualitative in nature, posing problems for traditional models. Here, we aimed to model uncertainty attitudes in decisions with qualitative outcomes. Participants made choices between certain outcomes and the chance for more favorable outcomes in quantitative (monetary) and qualitative (medical) modalities. Using computational modeling, we estimated the values participants assigned to qualitative outcomes and compared uncertainty attitudes across domains. Our model provided a good fit for the data, including quantitative estimates for qualitative outcomes. The model outperformed a utility function in quantitative decisions. Additionally, we found an association between ambiguity attitudes across domains. Results were replicated in an independent sample. We demonstrate the ability to extract quantitative measures from qualitative outcomes, leading to better estimation of subjective values. This allows for the characterization of individual behavior traits under a wide range of conditions.
Nachshon Korem, Or Duek, Ruonan Jia, Emily Wertheimer, Sierra Metviner, Michael Grubb, Ifat Levy
PLoS Comput. Biol.6
2013 Peaches, lemons, and cookies: designing auction markets with dispersed information
abstract
This paper studies the role of information asymmetries in second price, common value auctions. Motivated by information structures that arise commonly in applications such as online advertising, we seek to understand what types of information asymmetries lead to substantial reductions in revenue for the auctioneer. One application of our results concerns online advertising auctions in the presence of "cookies," which allow individual advertisers to recognize advertising opportunities for users who, for example, are customers of their websites. Cookies create substantial information asymmetries both ex ante and at the interim stage, when advertisers form their beliefs. The paper proceeds by first introducing a new refinement of Nash equilibrium, which we call "tremble robust equilibrium" (TRE), which overcomes the problem of multiplicity of equilibria in many domains of interest. Second, we consider a special information structure, where only one bidder has access to superior information, and show that the seller's revenue in the unique TRE is equal to the expected value of the object conditional on the lowest possible signal, no matter how unlikely it is that this signal is realized. Thus, if cookies identify especially good users, revenue may not be affected much, but if cookies can (even occasionally) be used to identify very poor users, the revenue consequences are severe. In the third part of the paper, we study the case where multiple bidders may be informed, providing additional characterizations of the impact of information structure on revenue. Finally, we consider richer market designs that ensure greater revenue for the auctioneer, for example by auctioning the right to participate in the mechanism.
Ittai Abraham, Susan Athey, Moshe Babaioff, Michael Grubb
EC4