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 Ostrovsky

dblp:58/7045 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0002-4670-3348ORCID · corroborated

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

Artificial intelligence and machine learning · 7 · 3 first-author · 1 since 2021Theory of computation · 7 · 3 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
6 papers
Algorithmic game theory and mechanism design · 100%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
auction design
0.622021
Choice Screen Auctions · EC 2021
Reserve prices in internet advertising auctions: a field experiment · EC 2011
Algorithmic game theory and mechanism design
matching
0.522018
Chain Stability in Trading Networks · EC 2018
Full Substitutability in Trading Networks · EC 2015
Algorithmic game theory and mechanism design › matching
trading networks
0.522018
Chain Stability in Trading Networks · EC 2018
Full Substitutability in Trading Networks · EC 2015
Algorithmic game theory and mechanism design › market equilibrium
competitive equilibrium
0.312018
Chain Stability in Trading Networks · EC 2018
Algorithmic game theory and mechanism design › equilibrium analysis
equilibrium existence
0.212015
Full Substitutability in Trading Networks · EC 2015
Algorithmic game theory and mechanism design › market equilibrium
substitutability
0.212015
Full Substitutability in Trading Networks · EC 2015
Algorithmic game theory and mechanism design › market dynamics
market microstructure
0.212014
Strategic trading in informationally complex environments · EC 2014
Algorithmic game theory and mechanism design › auction theory › advertising auctions
internet ad auction
0.112011
Reserve prices in internet advertising auctions: a field experiment · EC 2011
Algorithmic game theory and mechanism design › mechanism design › auction design
reserve price
0.112011
Reserve prices in internet advertising auctions: a field experiment · EC 2011
Computational finance and economics › mechanism design
information aggregation
0.112009
Information aggregation in dynamic markets with strategic traders · EC 2009
Computational finance and economics
market microstructure
0.112009
Information aggregation in dynamic markets with strategic traders · EC 2009
Computational finance and economics › mechanism design
revenue maximization
0.012011
Reserve prices in internet advertising auctions: a field experiment · EC 2011
Algorithmic game theory and mechanism design › game dynamics
equilibrium convergence
0.012009
Information aggregation in dynamic markets with strategic traders · EC 2009

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

empirical analysis · 1.0auction theory · 1.0optimal auction theory · 0.2field experiment · 0.2probability theory · 0.2game theory · 0.2kyle model · 0.2equilibrium analysis · 0.2
YearPublicationVenuePosition
2021 Choice Screen Auctions
abstract
Choice screen auctions have been recently deployed in 31 European countries, allowing consumers to choose their preferred search engine on Google's Android platform instead of being automatically defaulted to Google's own search engine. I show that a seemingly minor detail in the design of these auctions---whether they are conducted on a "per appearance" or a "per install" basis---plays a major role in the mix and characteristics of auction winners, and, consequently, in their expected overall market share. I also show that "per install" auctions distort the incentives of alternative search engines toward extracting as much revenue as possible from each user who installs them, at the expense of lowering the expected number of such users. The distortion becomes worse as the auction gets more competitive and the number of bidders increases. Empirical evidence from Android choice screen auctions conducted in 2020 is consistent with my theoretical results.
Michael Ostrovsky
EC1
2018 Chain Stability in Trading Networks
abstract
We consider general trading networks with bilateral contracts. We show that a suitably adapted chain stability concept is equivalent to stability if all agents' preferences are jointly fully substitutable and satisfy the Laws of Aggregate Supply and Demand (a condition we call monotone - substitutability). We also present three examples to show that are results are sharp, demonstrating that: If preferences of some agents do not satisfy the Laws of Aggregate Supply and Demand, then chain stable outcomes may not be stable. " If preferences of some agents are not fully substitutable, then chain stable outcomes may likewise not be stable. " If blocking sets are restricted to chains that do not "cross" themselves (i.e., chains that involve each agent in at most two contracts), then an outcome that is robust to such blocks may not be robust to richer blocks. Our results imply that in trading networks with transferable utility, an outcome is consistent with competitive equilibrium if and only if it is not blocked by any chain of contracts. We show moreover that, from a computational perspective, checking whether an outcome is chain stable is substantially easier than checking whether that outcome is stable directly. Indeed, we show that as the size of the economy grows, the number of chains of trades (corresponding to possible blocking chains) becomes infinitely smaller than the number of general sets of trades (corresponding to possible blocking sets).
John William Hatfield, Scott Duke Kominers, Alexandru Nichifor, Michael Ostrovsky, Alexander Westkamp
EC4
2015 Full Substitutability in Trading Networks
abstract
Various forms of substitutability are essential for establishing the existence of equilibria and other useful properties in diverse settings such as matching, auctions, and exchange economies with indivisible goods. In this paper, we extend earlier models' canonical definitions of substitutability to a setting in which an agent can be a buyer in some transactions and a seller in others, and show that all the different substitutability concepts are equivalent. Next, we introduce a new class of fully substitutable preferences that models the preferences of intermediaries with production capacity. We then prove that substitutability is preserved under economically important transformations such as trade endowments, mergers, and limited liability. We show that full substitutability can be recast in terms of submodularity of the indirect utility function, the single improvement property, a "no complementarities" condition, and a condition from discrete convex analysis called M♮-concavity. Finally, we show that substitutability implies two key monotonicity conditions known as the Laws of Aggregate Supply and Demand. All of our results explicitly incorporate economically important features such as indifferences, non-monotonicities, and unbounded utility functions that were not fully addressed in prior work.
John William Hatfield, Scott Duke Kominers, Alexandru Nichifor, Michael Ostrovsky, Alexander Westkamp
EC4
2014 Strategic trading in informationally complex environments
abstract
We study trading behavior and the properties of prices in informationally complex markets. Our model is based on the single-period version of the linear-normal framework of [Kyle 1985]. We allow for essentially arbitrary correlations among the random variables involved in the model: the true value of the traded asset, the signals of strategic traders, the signals of competitive market makers, and the demand coming from liquidity traders. We first show that there always exists a unique linear equilibrium, characterize it analytically, and illustrate its properties in a series of examples. We then use this equilibrium characterization to study the informational efficiency of prices as the number of strategic traders becomes large. If the demand from liquidity traders is uncorrelated with the true value of the asset or is positively correlated with it (conditional on other signals), then prices in large markets aggregate all available information. If, however, the demand from liquidity traders is negatively correlated with the true value of the asset, then prices in large markets aggregate all available information except that contained in liquidity demand.
Nicolas S. Lambert, Michael Ostrovsky, Mikhail Panov
EC2
2011 Reserve prices in internet advertising auctions: a field experiment
abstract
We present the results of a large field experiment on setting reserve prices in auctions for online advertisements, guided by the theory of optimal auction design suitably adapted to the sponsored search setting. Consistent with the theory, following the introduction of new reserve prices revenues in these auctions have increased substantially.
Michael Ostrovsky, Michael Schwarz 0002
EC1
2011 Obituary
Max Nalsky, Michael Ostrovsky
Comput. Complex.2
2009 Information aggregation in dynamic markets with strategic traders
abstract
This paper studies information aggregation in dynamic markets with a finite number of partially informed strategic traders. It shows that for a broad class of securities, information in such markets always gets aggregated. Trading takes place in a bounded time interval, and in every equilibrium, as time approaches the end of the interval, the market price of a "separable" security converges in probability to its expected value based on the traders' pooled information.
Michael Ostrovsky
EC1
2007 Strategic bidder behavior in sponsored search auctions
Benjamin Edelman, Michael Ostrovsky
Decis. Support Syst.2