Optimal stopping, satisficing and scarce. attention. Pantelis Pipergias Analytis. attention. 1 Cornell University.

Similar documents
Click Models for Web Search

Secretary Problems. Petropanagiotaki Maria. January MPLA, Algorithms & Complexity 2

Bayesian Learning in Social Networks

Power Laws & Rich Get Richer

SELECTING THE LAST RECORD WITH RECALL IN A SEQUENCE OF INDEPENDENT BERNOULLI TRIALS

Crowd-Learning: Improving the Quality of Crowdsourcing Using Sequential Learning

Hypothesis testing: theory and methods

Graduate Microeconomics II Lecture 5: Cheap Talk. Patrick Legros

Online Appendix to Strategy-proof tie-breaking in matching with priorities

Summary: the confidence interval for the mean (σ 2 known) with gaussian assumption

Notes on General Equilibrium

Colored Bin Packing: Online Algorithms and Lower Bounds

2 Making the Exponential Mechanism Exactly Truthful Without

Labor Economics, Lecture 11: Partial Equilibrium Sequential Search

Bayesian Decision Theory

ECON4515 Finance theory 1 Diderik Lund, 5 May Perold: The CAPM

Definitions and Proofs

Diffusion of Innovation

Midterm exam CS 189/289, Fall 2015

1 Overview. 2 Learning from Experts. 2.1 Defining a meaningful benchmark. AM 221: Advanced Optimization Spring 2016

COMS 4721: Machine Learning for Data Science Lecture 20, 4/11/2017

Consideration Sets. Mark Dean. Behavioral Economics G6943 Fall 2015

Incentives Work: Getting Teachers to Come to School. Esther Duflo, Rema Hanna, and Stephen Ryan. Web Appendix

Review. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda

COORDINATION AND EQUILIBRIUM SELECTION IN GAMES WITH POSITIVE NETWORK EFFECTS

Supplementary Materials for. Forecast Dispersion in Finite-Player Forecasting Games. March 10, 2017

3.10 Lagrangian relaxation

H 2 : otherwise. that is simply the proportion of the sample points below level x. For any fixed point x the law of large numbers gives that

Political Economy of Institutions and Development: Problem Set 1. Due Date: Thursday, February 23, in class.

Lecture 8 Inequality Testing and Moment Inequality Models

STAT 515 fa 2016 Lec Statistical inference - hypothesis testing

Economics 2010c: Lectures 9-10 Bellman Equation in Continuous Time

Sequential Approval. Paola Manzini Marco Mariotti Levent Ülkü. Manzini Mariotti Ülkü Sequential Approval BRIColumbia 1 / 36

Notes on Heterogeneity, Aggregation, and Market Wage Functions: An Empirical Model of Self-Selection in the Labor Market

Lecture 2: Just married

+ 5x 2. = x x. + x 2. Transform the original system into a system x 2 = x x 1. = x 1

8. Hypothesis Testing

Module 9: Stationary Processes

AN EXTERNALITY BASED DECENTRALIZED OPTIMAL POWER ALLOCATION SCHEME FOR WIRELESS MESH NETWORKS

Web Structure Mining Nodes, Links and Influence

Microeconomics, Block I Part 2

Sequential Decisions

EconS Advanced Microeconomics II Handout on Subgame Perfect Equilibrium (SPNE)

Building socio-economic Networks: How many conferences should you attend?

Worst case analysis for a general class of on-line lot-sizing heuristics

Other-Regarding Preferences: Theory and Evidence

Advanced Statistics II: Non Parametric Tests

Econ 2148, spring 2019 Statistical decision theory

Diffusion of Innovation and Influence Maximization

Relating Graph to Matlab

Wireless Network Pricing Chapter 6: Oligopoly Pricing

U b (x b ) = xb 1x b 2 x a 1. means the consumption of good i by an h-type person.

PCA with random noise. Van Ha Vu. Department of Mathematics Yale University

Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence

Polyhedral Approaches to Online Bipartite Matching

Preference Signaling with Multiple Agents

INFORMS ANNUAL MEETING WASHINGTON D.C. 2008

Empirical Market Microstructure Analysis (EMMA)

Psychology and Economics (Lecture 24)

Decision trees COMS 4771

Observational Learning and Demand for Search Goods

EE 5407 Part II: Spatial Based Wireless Communications

Economics of Networks Social Learning

1 Submodular functions

Chapter 3 Deterministic planning

CHAPTER 3. THE IMPERFECT CUMULATIVE SCALE

9 Brownian Motion: Construction

Online Appendices for Large Matching Markets: Risk, Unraveling, and Conflation

Online Appendix to A search model of costly product returns by Vaiva Petrikaitė

arxiv: v1 [math.pr] 3 Sep 2010

OPTIMIZING SEARCH ENGINES USING CLICKTHROUGH DATA. Paper By: Thorsten Joachims (Cornell University) Presented By: Roy Levin (Technion)

Overall Plan of Simulation and Modeling I. Chapters

The Design of a Survival Study

Biased Assimilation, Homophily, and the Dynamics of Polarization

Supervised Learning: Non-parametric Estimation

Unit 14: Nonparametric Statistical Methods

Lecture Slides - Part 1

PERCOLATION IN SELFISH SOCIAL NETWORKS

A Optimal User Search

Robust Testing and Variable Selection for High-Dimensional Time Series

Econometrics I KS. Module 2: Multivariate Linear Regression. Alexander Ahammer. This version: April 16, 2018

Diffusion of Innovations in Social Networks

Redistribution Mechanisms for Assignment of Heterogeneous Objects

The Impact of Organizer Market Structure on Participant Entry Behavior in a Multi-Tournament Environment

More on Input Distributions

Measuring relationships among multiple responses

CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves

Welfare Undominated Groves Mechanisms

With high probability

Cambridge Networks Day 2013 Sainsbury Laboratory University of Cambridge. Social Mechanisms in Real and Virtual Networks

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016

Lecture 2 The Centralized Economy: Basic features

CS 573: Algorithmic Game Theory Lecture date: April 11, 2008

Microeconometria Day # 5 L. Cembalo. Regressione con due variabili e ipotesi dell OLS

Estimating the Dynamic Effects of a Job Training Program with M. Program with Multiple Alternatives

Detection theory 101 ELEC-E5410 Signal Processing for Communications

Uncertainty and Disagreement in Equilibrium Models

Sequential Decisions

The Beginning of Graph Theory. Theory and Applications of Complex Networks. Eulerian paths. Graph Theory. Class Three. College of the Atlantic

Low-Regret for Online Decision-Making

Transcription:

1 Cornell University January 29, 2018

The secretary problem

Assumptions Single position to fill. There are n applicants for the position, and the value of n is known. The applicants, if seen altogether, can be ranked from best to worst unambiguously. The applicants are interviewed sequentially in random order, with each order being equally likely. Immediately after an interview, the interviewed applicant is either accepted or rejected. The decision to accept or reject an applicant can be based only on the relative ranks of the applicants. The objective of the general solution is to have the highest probability of selecting the best applicant.

Performance of different heuristic strategies

Searching for a book

The random search world (sequential search) 6 utility Utility 4 6 4 2 0 2 0 0 25 50 75 100 Index

The random search model R n (u 1, u 2,..., u n ) = max(u 1, u 2,...u n ) nc (1) R(u n, c) = P (u n > max(u 1, u 2,...u n 1 )) (2) E(u n max(u 1, u 2,...u n 1 ) u n > max(u 1, u 2,...u n 1 )) c stopping rule Sample the alternatives at random if u n > T opt (c), stop sampling (3) if u n T opt (c), continue sampling

Discussion: Online dating as a search problem

The Microeconomics 101 world 10.0 7.5 Utility 5.0 utility 10.0 7.5 5.0 2.5 0.0 2.5 0.0 0.0 2.5 5.0 7.5 10.0 George's opinion

The discrete choice world 10 8 Utility 6 utility 10.0 7.5 5.0 2.5 0.0 4 2 0.0 2.5 5.0 7.5 10.0 Record's av. review

A simple model R(A k ) = P (u k > y) E(u k y c u k > y) P (u k y) c = P (u k > y) E(u k y u k > y) c. (4) If for two alternatives A i, A j S, f(a i ) > f(a j ) then R(A i ) > R(A j ). Selection rule: Order the alternatives based on their unconditional expectation. Select the items for sampling in this order. Stopping rule: If at any stage subjective expected gain is negative, terminate the search.

A concrete example Utility -1 0 1 2 3 4 EU RU K 2.24 1.87 L 1.65 2.27 M 0.92 NA M^ L K 0 2 4 6 8 10 Average rating P (u L > u K ) = 0.33, E(u L u K u L > u K ) = 0.329 P (u M > u L ) = 0.003 and E(u M u L u M > u L ) = 0.152

Multi-attribute utility models Multi-linear utility (MLU): f(a i1,.., a im ) = j β ja ij It is one of the cornerstone models in multi-attribute decision making (Keeney and Raiffa, 1993). Equal weighted linear utility (EW): f(a i1,.., a im ) = j a i j, where all the attributes a i1,.., a im are normalized and brought on the same scale. Originally, suggested by Dawes and Corrigan (1974). Single attribute utility (SA): f(a i1,.., a im ) = a ij where a ij has highest ecological validity amongst {a i1,.., a im } as it is expressed by Kendall s tau non-parametric correlation. Initially studied by Hogarth and Kareleia (2005).

Discussion: Online marketplaces and search

The eyetracking study: design

The eyetracking study: results

The eyetracking study: design Percentage 80 70 60 50 40 30 20 10 % of fixations % of clicks 0 1 2 3 4 5 6 7 8 9 10 Rank of Abstract Figure 1: Percentage of times an abstract was viewed/clicked depending on the rank of the result.

Click models ur 1q urq Ar 1 document u r 1 Ar document u r Cr 1 Cr... Er 1 Er... Figure 3.2: Graphical representation of the cascade model (fragment).

Bestseller search: an example

Bestseller search: another example

Bestseller search: yet another example

The music lab experiment (Salganik, Watts and Dodds, 2006)

Inequality in markets for cultural products

Unpredictability in markets for cultural products

Introducing social influence and variability in taste The market is populated by M agents A 1,..., A M. Objective utility component u o identical for all the agents, and subjective component u s, agent specific. The overall utility u i = u oi + u si. The objective component and subjective component are (iid) random variable with mean µ and variance σ 2. Overall variance σ 2 = σ 2 oi + σ2 si. Popularity heuristic The agents sample the alternatives X 1, X 2...X n in decreasing order of popularity P 1 > P 2 >... > P n, if u n > T pop, stop sampling (5) if u n T pop, continue sampling

Popularity search: an example 7.5 utility 10.0 Utility 5.0 7.5 5.0 2.5 0.0 2.5 0.0 2.5 5.0 7.5 10.0 Popularity Note that for c = 0 the two processes imply a perfect knowledge market.

Discussion: Ranking in social media

Probability of choosing a sampled alternative If the alternative i is searched, it is accepted with some probability p i. p i = P r(u i,s + u i,o > T ) = P r(u i,s > T u i,o ). In a realization of the environment, the threshold T and the u i,o s are fixed, while u i,s is a random variable

Probability of choosing an alternative Suppose the agent has decided to search the alternatives with search order δ. The probability that the agent searches and accepts the alternative δ 2 is (1 p δ1 ) p δ2. Similarly, the probability that the agent searches and accepts the alternative δ 3 is (1 p δ1 ) (1 p δ2 ) p δ3. In general, the probability that the agent searches and accepts the alternative δ k is k 1 (1 p δi ) p δk. i=1

Ordering We define its ordering as a pair of vectors (γ, ζ) that tell us which alternative has the highest popularity, which one is second, etc., taking into account the possible ties. Definition For a vector P, we call the pair (γ, ζ) its ordering. If ζ consists only of 0 s, that is if all popularities are different, then we call (γ, ζ) a strict ordering.

ordering Definition We call an ordering (γ, ζ) optimal if it maximizes the agents expected return. Suppose that 0 < p i < 1 for all i. Let f i denote the probability density function of u i and define g i to be the expected value of u i conditioned on u i > T. That is, g i = T u if i (u i )du i T f i(u i )du i. Then (γ, ζ) maximizes the expected utility for an agent if and only if g γ1... g γn and g γi = g γi+1 whenever ζ i = 1.

Terminal orderings and settling Definition Let r n be the ordering of the popularity vector at time n. We say that r n settles on (γ, ζ) R, if there exists some n 0, such that r n = (γ, ζ), for all n n 0. We say that an ordering (γ, ζ) R is terminal, if P r (r n settles on (γ, ζ)) > 0. Otherwise, we say that (γ, ζ) is non-terminal. Theorem The ordering of the popularity vector r n eventually settles on some ordering with probability 1. If 0 < p i < 1 for each i, then every non-strict ordering (γ, ζ) is non-terminal. Therefore, r n will settle on some strict ordering.

Strict ordering and existence proof Part of Theorem 4 states that non-strict orderings are always non-terminal, except in trivial cases. But a strict ordering might be either terminal or non-terminal. The following Theorem gives necessary and sufficient conditions for a strict ordering to be terminal. Theorem A strict ordering γ is terminal if and only if q γ γ 1 > q γ γ 2 >... > q γ γ N.

Eventual market shares Corollary A strict ordering γ with the property p γ1... p γn is terminal. Theorem Suppose that r n settles on the strict ordering γ. Then, for each i, Pn i lim n n = qγ i, a.s.

An example Imagine the market for textbooks in Advanced Microeconomics. Three alternatives with objective qualities u 1 = 1.525, u 2 = 1 and u 3 = 0.475. subjective utilities u i,s are Gaussian random variables with mean 0 and a given variance σ 2 = 1 and the threshold T is equal to 1. The above objective utilities have been chosen so that, approximately, p 1 = 0.7, p 2 = 0.5 and p 3 = 0.3 ordering p 1 > p 2 > p 3. cost = 0.5

An example γ q 1 q 2 q 3 Terminal ū ˆp γ 1,2,3 0.748 0.184 0.068 Yes 0.540 0.844 1,3,2 0.748 0.139 0.113 No 0.493 0 2,1,3 0.398 0.534 0.068 Yes 0.180 0.146 2,3,1 0.293 0.534 0.173 No -0.340 0 3,2,1 0.293 0.384 0.323 No -0.188 0 3,1,2 0.538 0.139 0.323 No 0.062 0

Average welfare 2.00 1 1.2 1.5 1.8 2.5 4.6 Average utility and cost 1.75 1.50 1.25 1.00 0.75 0.50 0.25 0.00 c = 1 2 3 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Gross utility Net utility Cost Diversity of preferences

Welfare dynamics Net utility 1.4 1.2 1.0 d = 0 d = 0.2 d = 0.5 d = 0.8 Total cost 0.6 0.5 0.4 0.3 d = 1 d = 0.8 0.8 d = 1 0.2 d = 0 d = 0.2 d = 0.5 1 23 4 56 7 89 10 1112 13 1415 1 23 4 56 7 89 10 1112 13 1415 Block

End state distributions 1 1 1 0-2 -1 0 1 2 0-2 -1 0 1 2 0-1 0 1 0.5 0.3 0.15 0-2 -1 0 1 2 0-2 -1 0 1 2 0-1 0 1 0.08 0.05 0.04 0-2 -1 0 1 2 0-2 -1 0 1 2 0-1 0 1

Market inequality 1.0 Popularity search Random search 0.9 Gini coefficient 0.8 0.7 0.6 0.5 d = 0.5 d = 0.5 1 2 3 1 2 4 1 2 5 1 2 6 1 2 7 1 2 3 1 2 4 1 2 5 1 2 6 1 2 7 Search cost

Market unpredictability 1.00 Popularity search d = 0.5 Random search d = 0.5 Market unpredictability coefficient 0.75 0.50 0.25 0.00 1 2 3 1 2 4 1 2 5 1 2 6 1 2 7 1 2 3 1 2 4 1 2 5 1 2 6 1 2 7 Search cost

Summary New model of popularity dynamics. Simple mechanism that explains the inequality and unpredictability....and stresses the importance of quality and taste differences. It generates predictions for the collection of empirical data in the future. The model illustrates why some heterogeneity in taste can be beneficial for collectives.