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

Nina Bobkova

dblp:259/0572 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
auction design
0.412020
Information Choice in Auctions · EC 2020
Algorithmic game theory and mechanism design › mechanism design › auction design
common value auction
0.412020
Information Choice in Auctions · EC 2020
Algorithmic game theory and mechanism design › decision theory
information acquisition
0.412020
Information Choice in Auctions · EC 2020

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

game theory · 0.4equilibrium analysis · 0.4
YearPublicationVenuePosition
2020 Information Choice in Auctions
abstract
Bidders are uncertain about their valuation for an object and choose about which component to learn. Their valuation consists of a common value component (which matters to all bidders) and a private value component (which is relevant only to individual bidders). Learning about a private component yields independent estimates, whereas learning about a common component leads to correlated information between bidders. I analyze the incentives of bidders to choose information about components in the second-price, the first-price and the all-pay auction. I identify conditions for the second-price auction, such that bidders only learn about their private component: an independent private value framework and an efficient outcome arise endogenously. In a first-price auction, every robust equilibrium is inefficient under certain conditions.
Nina Bobkova
EC1