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

Size: px
Start display at page:

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

Transcription

1 1 Cornell University January 29, 2018

2 The secretary problem

3 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.

4 Performance of different heuristic strategies

5

6 Searching for a book

7 The random search world (sequential search) 6 utility Utility Index

8 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

9 Discussion: Online dating as a search problem

10 The Microeconomics 101 world Utility 5.0 utility George's opinion

11 The discrete choice world 10 8 Utility 6 utility Record's av. review

12 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.

13 A concrete example Utility EU RU K L M 0.92 NA M^ L K Average rating P (u L > u K ) = 0.33, E(u L u K u L > u K ) = P (u M > u L ) = and E(u M u L u M > u L ) = 0.152

14 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).

15 Discussion: Online marketplaces and search

16 The eyetracking study: design

17 The eyetracking study: results

18 The eyetracking study: design Percentage % of fixations % of clicks Rank of Abstract Figure 1: Percentage of times an abstract was viewed/clicked depending on the rank of the result.

19 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).

20 Bestseller search: an example

21 Bestseller search: another example

22 Bestseller search: yet another example

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

24 Inequality in markets for cultural products

25 Unpredictability in markets for cultural products

26 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

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

28 Discussion: Ranking in social media

29 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

30 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

31 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.

32 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.

33 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.

34 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.

35 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.

36 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 = 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

37 An example γ q 1 q 2 q 3 Terminal ū ˆp γ 1,2, Yes ,3, No ,1, Yes ,3, No ,2, No ,1, No

38 Average welfare Average utility and cost c = Gross utility Net utility Cost Diversity of preferences

39 Welfare dynamics Net utility d = 0 d = 0.2 d = 0.5 d = 0.8 Total cost d = 1 d = d = d = 0 d = 0.2 d = Block

40 End state distributions

41 Market inequality 1.0 Popularity search Random search 0.9 Gini coefficient d = 0.5 d = Search cost

42 Market unpredictability 1.00 Popularity search d = 0.5 Random search d = 0.5 Market unpredictability coefficient Search cost

43 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.

Click Models for Web Search

Click Models for Web Search Click Models for Web Search Lecture 1 Aleksandr Chuklin, Ilya Markov Maarten de Rijke a.chuklin@uva.nl i.markov@uva.nl derijke@uva.nl University of Amsterdam Google Research Europe AC IM MdR Click Models

More information

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

Secretary Problems. Petropanagiotaki Maria. January MPLA, Algorithms & Complexity 2 January 15 2015 MPLA, Algorithms & Complexity 2 Simplest form of the problem 1 The candidates are totally ordered from best to worst with no ties. 2 The candidates arrive sequentially in random order.

More information

Bayesian Learning in Social Networks

Bayesian Learning in Social Networks Bayesian Learning in Social Networks Asu Ozdaglar Joint work with Daron Acemoglu, Munther Dahleh, Ilan Lobel Department of Electrical Engineering and Computer Science, Department of Economics, Operations

More information

Power Laws & Rich Get Richer

Power Laws & Rich Get Richer Power Laws & Rich Get Richer CMSC 498J: Social Media Computing Department of Computer Science University of Maryland Spring 2015 Hadi Amiri hadi@umd.edu Lecture Topics Popularity as a Network Phenomenon

More information

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

SELECTING THE LAST RECORD WITH RECALL IN A SEQUENCE OF INDEPENDENT BERNOULLI TRIALS Statistica Sinica 19 (2009), 355-361 SELECTING THE LAST RECORD WITH RECALL IN A SEQUENCE OF INDEPENDENT BERNOULLI TRIALS Jiing-Ru Yang Diwan College of Management Abstract: Given a sequence of N independent

More information

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

Crowd-Learning: Improving the Quality of Crowdsourcing Using Sequential Learning Crowd-Learning: Improving the Quality of Crowdsourcing Using Sequential Learning Mingyan Liu (Joint work with Yang Liu) Department of Electrical Engineering and Computer Science University of Michigan,

More information

Hypothesis testing: theory and methods

Hypothesis testing: theory and methods Statistical Methods Warsaw School of Economics November 3, 2017 Statistical hypothesis is the name of any conjecture about unknown parameters of a population distribution. The hypothesis should be verifiable

More information

Graduate Microeconomics II Lecture 5: Cheap Talk. Patrick Legros

Graduate Microeconomics II Lecture 5: Cheap Talk. Patrick Legros Graduate Microeconomics II Lecture 5: Cheap Talk Patrick Legros 1 / 35 Outline Cheap talk 2 / 35 Outline Cheap talk Crawford-Sobel Welfare 3 / 35 Outline Cheap talk Crawford-Sobel Welfare Partially Verifiable

More information

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

Online Appendix to Strategy-proof tie-breaking in matching with priorities Online Appendix to Strategy-proof tie-breaking in matching with priorities Lars Ehlers Alexander Westkamp December 12, 2017 Section 1 contains the omitted proofs of Lemma 5, Lemma 6 and Lemma 7 Subsection

More information

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

Summary: the confidence interval for the mean (σ 2 known) with gaussian assumption Summary: the confidence interval for the mean (σ known) with gaussian assumption on X Let X be a Gaussian r.v. with mean µ and variance σ. If X 1, X,..., X n is a random sample drawn from X then the confidence

More information

Notes on General Equilibrium

Notes on General Equilibrium Notes on General Equilibrium Alejandro Saporiti Alejandro Saporiti (Copyright) General Equilibrium 1 / 42 General equilibrium Reference: Jehle and Reny, Advanced Microeconomic Theory, 3rd ed., Pearson

More information

Colored Bin Packing: Online Algorithms and Lower Bounds

Colored Bin Packing: Online Algorithms and Lower Bounds Noname manuscript No. (will be inserted by the editor) Colored Bin Packing: Online Algorithms and Lower Bounds Martin Böhm György Dósa Leah Epstein Jiří Sgall Pavel Veselý Received: date / Accepted: date

More information

2 Making the Exponential Mechanism Exactly Truthful Without

2 Making the Exponential Mechanism Exactly Truthful Without CIS 700 Differential Privacy in Game Theory and Mechanism Design January 31, 2014 Lecture 3 Lecturer: Aaron Roth Scribe: Aaron Roth Privacy as a Tool for Mechanism Design for arbitrary objective functions)

More information

Labor Economics, Lecture 11: Partial Equilibrium Sequential Search

Labor Economics, Lecture 11: Partial Equilibrium Sequential Search Labor Economics, 14.661. Lecture 11: Partial Equilibrium Sequential Search Daron Acemoglu MIT December 6, 2011. Daron Acemoglu (MIT) Sequential Search December 6, 2011. 1 / 43 Introduction Introduction

More information

Bayesian Decision Theory

Bayesian Decision Theory Bayesian Decision Theory Dr. Shuang LIANG School of Software Engineering TongJi University Fall, 2012 Today s Topics Bayesian Decision Theory Bayesian classification for normal distributions Error Probabilities

More information

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

ECON4515 Finance theory 1 Diderik Lund, 5 May Perold: The CAPM Perold: The CAPM Perold starts with a historical background, the development of portfolio theory and the CAPM. Points out that until 1950 there was no theory to describe the equilibrium determination of

More information

Definitions and Proofs

Definitions and Proofs Giving Advice vs. Making Decisions: Transparency, Information, and Delegation Online Appendix A Definitions and Proofs A. The Informational Environment The set of states of nature is denoted by = [, ],

More information

Diffusion of Innovation

Diffusion of Innovation Diffusion of Innovation Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social Network Analysis

More information

Midterm exam CS 189/289, Fall 2015

Midterm exam CS 189/289, Fall 2015 Midterm exam CS 189/289, Fall 2015 You have 80 minutes for the exam. Total 100 points: 1. True/False: 36 points (18 questions, 2 points each). 2. Multiple-choice questions: 24 points (8 questions, 3 points

More information

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

1 Overview. 2 Learning from Experts. 2.1 Defining a meaningful benchmark. AM 221: Advanced Optimization Spring 2016 AM 1: Advanced Optimization Spring 016 Prof. Yaron Singer Lecture 11 March 3rd 1 Overview In this lecture we will introduce the notion of online convex optimization. This is an extremely useful framework

More information

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

COMS 4721: Machine Learning for Data Science Lecture 20, 4/11/2017 COMS 4721: Machine Learning for Data Science Lecture 20, 4/11/2017 Prof. John Paisley Department of Electrical Engineering & Data Science Institute Columbia University SEQUENTIAL DATA So far, when thinking

More information

Consideration Sets. Mark Dean. Behavioral Economics G6943 Fall 2015

Consideration Sets. Mark Dean. Behavioral Economics G6943 Fall 2015 Consideration Sets Mark Dean Behavioral Economics G6943 Fall 2015 What is Bounded Rationality? Start with a standard economic model e.g. utility maximization C (A) = max x A u(x) If the model is wrong

More information

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

Incentives Work: Getting Teachers to Come to School. Esther Duflo, Rema Hanna, and Stephen Ryan. Web Appendix Incentives Work: Getting Teachers to Come to School Esther Duflo, Rema Hanna, and Stephen Ryan Web Appendix Online Appendix: Estimation of model with AR(1) errors: Not for Publication To estimate a model

More information

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

Review. DS GA 1002 Statistical and Mathematical Models.   Carlos Fernandez-Granda Review DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Probability and statistics Probability: Framework for dealing with

More information

COORDINATION AND EQUILIBRIUM SELECTION IN GAMES WITH POSITIVE NETWORK EFFECTS

COORDINATION AND EQUILIBRIUM SELECTION IN GAMES WITH POSITIVE NETWORK EFFECTS COORDINATION AND EQUILIBRIUM SELECTION IN GAMES WITH POSITIVE NETWORK EFFECTS Alexander M. Jakobsen B. Curtis Eaton David Krause August 31, 2009 Abstract When agents make their choices simultaneously,

More information

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

Supplementary Materials for. Forecast Dispersion in Finite-Player Forecasting Games. March 10, 2017 Supplementary Materials for Forecast Dispersion in Finite-Player Forecasting Games Jin Yeub Kim Myungkyu Shim March 10, 017 Abstract In Online Appendix A, we examine the conditions under which dispersion

More information

3.10 Lagrangian relaxation

3.10 Lagrangian relaxation 3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the

More information

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

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 Lecture 28 28.1 Kolmogorov-Smirnov test. Suppose that we have an i.i.d. sample X 1,..., X n with some unknown distribution and we would like to test the hypothesis that is equal to a particular distribution

More information

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

Political Economy of Institutions and Development: Problem Set 1. Due Date: Thursday, February 23, in class. Political Economy of Institutions and Development: 14.773 Problem Set 1 Due Date: Thursday, February 23, in class. Answer Questions 1-3. handed in. The other two questions are for practice and are not

More information

Lecture 8 Inequality Testing and Moment Inequality Models

Lecture 8 Inequality Testing and Moment Inequality Models Lecture 8 Inequality Testing and Moment Inequality Models Inequality Testing In the previous lecture, we discussed how to test the nonlinear hypothesis H 0 : h(θ 0 ) 0 when the sample information comes

More information

STAT 515 fa 2016 Lec Statistical inference - hypothesis testing

STAT 515 fa 2016 Lec Statistical inference - hypothesis testing STAT 515 fa 2016 Lec 20-21 Statistical inference - hypothesis testing Karl B. Gregory Wednesday, Oct 12th Contents 1 Statistical inference 1 1.1 Forms of the null and alternate hypothesis for µ and p....................

More information

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

Economics 2010c: Lectures 9-10 Bellman Equation in Continuous Time Economics 2010c: Lectures 9-10 Bellman Equation in Continuous Time David Laibson 9/30/2014 Outline Lectures 9-10: 9.1 Continuous-time Bellman Equation 9.2 Application: Merton s Problem 9.3 Application:

More information

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

Sequential Approval. Paola Manzini Marco Mariotti Levent Ülkü. Manzini Mariotti Ülkü Sequential Approval BRIColumbia 1 / 36 Sequential Approval Paola Manzini Marco Mariotti Levent Ülkü Manzini Mariotti Ülkü Sequential Approval BRIColumbia 1 / 36 Motivation Consider an individual who: Scans headlines and reads some articles

More information

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

Notes on Heterogeneity, Aggregation, and Market Wage Functions: An Empirical Model of Self-Selection in the Labor Market Notes on Heterogeneity, Aggregation, and Market Wage Functions: An Empirical Model of Self-Selection in the Labor Market Heckman and Sedlacek, JPE 1985, 93(6), 1077-1125 James Heckman University of Chicago

More information

Lecture 2: Just married

Lecture 2: Just married COMP36111: Advanced Algorithms I Lecture 2: Just married Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2017 18 Outline Matching Flow networks Third-year projects The stable marriage problem

More information

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

+ 5x 2. = x x. + x 2. Transform the original system into a system x 2 = x x 1. = x 1 University of California, Davis Department of Agricultural and Resource Economics ARE 5 Optimization with Economic Applications Lecture Notes Quirino Paris The Pivot Method for Solving Systems of Equations...................................

More information

8. Hypothesis Testing

8. Hypothesis Testing FE661 - Statistical Methods for Financial Engineering 8. Hypothesis Testing Jitkomut Songsiri introduction Wald test likelihood-based tests significance test for linear regression 8-1 Introduction elements

More information

Module 9: Stationary Processes

Module 9: Stationary Processes Module 9: Stationary Processes Lecture 1 Stationary Processes 1 Introduction A stationary process is a stochastic process whose joint probability distribution does not change when shifted in time or space.

More information

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

AN EXTERNALITY BASED DECENTRALIZED OPTIMAL POWER ALLOCATION SCHEME FOR WIRELESS MESH NETWORKS AN EXTERNALITY BASED DECENTRALIZED OPTIMAL POWER ALLOCATION SCHEME FOR WIRELESS MESH NETWORKS Shruti Sharma and Demos Teneketzis Department of Electrical Engineering and Computer Science University of

More information

Web Structure Mining Nodes, Links and Influence

Web Structure Mining Nodes, Links and Influence Web Structure Mining Nodes, Links and Influence 1 Outline 1. Importance of nodes 1. Centrality 2. Prestige 3. Page Rank 4. Hubs and Authority 5. Metrics comparison 2. Link analysis 3. Influence model 1.

More information

Microeconomics, Block I Part 2

Microeconomics, Block I Part 2 Microeconomics, Block I Part 2 Piero Gottardi EUI Sept. 20, 2015 Piero Gottardi (EUI) Microeconomics, Block I Part 2 Sept. 20, 2015 1 / 48 Pure Exchange Economy H consumers with: preferences described

More information

Sequential Decisions

Sequential Decisions Sequential Decisions A Basic Theorem of (Bayesian) Expected Utility Theory: If you can postpone a terminal decision in order to observe, cost free, an experiment whose outcome might change your terminal

More information

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

EconS Advanced Microeconomics II Handout on Subgame Perfect Equilibrium (SPNE) EconS 3 - Advanced Microeconomics II Handout on Subgame Perfect Equilibrium (SPNE). Based on MWG 9.B.3 Consider the three-player nite game of perfect information depicted in gure. L R Player 3 l r a b

More information

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

Building socio-economic Networks: How many conferences should you attend? Prepared with SEVI S LIDES Building socio-economic Networks: How many conferences should you attend? Antonio Cabrales, Antoni Calvó-Armengol, Yves Zenou January 06 Summary Introduction The game Equilibrium

More information

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

Worst case analysis for a general class of on-line lot-sizing heuristics Worst case analysis for a general class of on-line lot-sizing heuristics Wilco van den Heuvel a, Albert P.M. Wagelmans a a Econometric Institute and Erasmus Research Institute of Management, Erasmus University

More information

Other-Regarding Preferences: Theory and Evidence

Other-Regarding Preferences: Theory and Evidence Other-Regarding Preferences: Theory and Evidence June 9, 2009 GENERAL OUTLINE Economic Rationality is Individual Optimization and Group Equilibrium Narrow version: Restrictive Assumptions about Objective

More information

Advanced Statistics II: Non Parametric Tests

Advanced Statistics II: Non Parametric Tests Advanced Statistics II: Non Parametric Tests Aurélien Garivier ParisTech February 27, 2011 Outline Fitting a distribution Rank Tests for the comparison of two samples Two unrelated samples: Mann-Whitney

More information

Econ 2148, spring 2019 Statistical decision theory

Econ 2148, spring 2019 Statistical decision theory Econ 2148, spring 2019 Statistical decision theory Maximilian Kasy Department of Economics, Harvard University 1 / 53 Takeaways for this part of class 1. A general framework to think about what makes a

More information

Diffusion of Innovation and Influence Maximization

Diffusion of Innovation and Influence Maximization Diffusion of Innovation and Influence Maximization Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics

More information

Relating Graph to Matlab

Relating Graph to Matlab There are two related course documents on the web Probability and Statistics Review -should be read by people without statistics background and it is helpful as a review for those with prior statistics

More information

Wireless Network Pricing Chapter 6: Oligopoly Pricing

Wireless Network Pricing Chapter 6: Oligopoly Pricing Wireless Network Pricing Chapter 6: Oligopoly Pricing Jianwei Huang & Lin Gao Network Communications and Economics Lab (NCEL) Information Engineering Department The Chinese University of Hong Kong Huang

More information

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

U b (x b ) = xb 1x b 2 x a 1. means the consumption of good i by an h-type person. Chapter 9 Welfare Exercise 9. In a two-commodity exchange economy there are two large equalsized groups of traders. Each trader in group a has an endowment of 300 units of commodity ; each person in group

More information

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

PCA with random noise. Van Ha Vu. Department of Mathematics Yale University PCA with random noise Van Ha Vu Department of Mathematics Yale University An important problem that appears in various areas of applied mathematics (in particular statistics, computer science and numerical

More information

Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence

Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence University of Pennsylvania ScholarlyCommons Operations, Information and Decisions Papers Wharton Faculty Research 11-2011 Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence Alessandro

More information

Polyhedral Approaches to Online Bipartite Matching

Polyhedral Approaches to Online Bipartite Matching Polyhedral Approaches to Online Bipartite Matching Alejandro Toriello joint with Alfredo Torrico, Shabbir Ahmed Stewart School of Industrial and Systems Engineering Georgia Institute of Technology Industrial

More information

Preference Signaling with Multiple Agents

Preference Signaling with Multiple Agents Preference Signaling with Multiple Agents Zachary Grossman (Florida State) Belief-Based Utility Conference CMU June 12 13, 2017 n image-conscious agents decide: Act (a i = 1) to bring about joint outcome

More information

INFORMS ANNUAL MEETING WASHINGTON D.C. 2008

INFORMS ANNUAL MEETING WASHINGTON D.C. 2008 Sensor Information Monotonicity in Disambiguation Protocols Xugang Ye Department of Applied Mathematics and Statistics, The Johns Hopkins University Stochastic ti Ordering Comparing Two Random Numbers:

More information

Empirical Market Microstructure Analysis (EMMA)

Empirical Market Microstructure Analysis (EMMA) Empirical Market Microstructure Analysis (EMMA) Lecture 3: Statistical Building Blocks and Econometric Basics Prof. Dr. Michael Stein michael.stein@vwl.uni-freiburg.de Albert-Ludwigs-University of Freiburg

More information

Psychology and Economics (Lecture 24)

Psychology and Economics (Lecture 24) Psychology and Economics (Lecture 24) Xavier Gabaix May 11, 2004 1 Animal metabolism and other universal laws How much energy E does one need to make an animal of size M function? The naive guess would

More information

Decision trees COMS 4771

Decision trees COMS 4771 Decision trees COMS 4771 1. Prediction functions (again) Learning prediction functions IID model for supervised learning: (X 1, Y 1),..., (X n, Y n), (X, Y ) are iid random pairs (i.e., labeled examples).

More information

Observational Learning and Demand for Search Goods

Observational Learning and Demand for Search Goods Observational Learning and Demand for Search Goods Kenneth Hendricks University of Texas at Austin Tom Wiseman University of Texas at Austin September 2010 Alan Sorensen Stanford University & NBER Abstract

More information

EE 5407 Part II: Spatial Based Wireless Communications

EE 5407 Part II: Spatial Based Wireless Communications EE 5407 Part II: Spatial Based Wireless Communications Instructor: Prof. Rui Zhang E-mail: rzhang@i2r.a-star.edu.sg Website: http://www.ece.nus.edu.sg/stfpage/elezhang/ Lecture II: Receive Beamforming

More information

Economics of Networks Social Learning

Economics of Networks Social Learning Economics of Networks Social Learning Evan Sadler Massachusetts Institute of Technology Evan Sadler Social Learning 1/38 Agenda Recap of rational herding Observational learning in a network DeGroot learning

More information

1 Submodular functions

1 Submodular functions CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: November 16, 2010 1 Submodular functions We have already encountered submodular functions. Let s recall

More information

Chapter 3 Deterministic planning

Chapter 3 Deterministic planning Chapter 3 Deterministic planning In this chapter we describe a number of algorithms for solving the historically most important and most basic type of planning problem. Two rather strong simplifying assumptions

More information

CHAPTER 3. THE IMPERFECT CUMULATIVE SCALE

CHAPTER 3. THE IMPERFECT CUMULATIVE SCALE CHAPTER 3. THE IMPERFECT CUMULATIVE SCALE 3.1 Model Violations If a set of items does not form a perfect Guttman scale but contains a few wrong responses, we do not necessarily need to discard it. A wrong

More information

9 Brownian Motion: Construction

9 Brownian Motion: Construction 9 Brownian Motion: Construction 9.1 Definition and Heuristics The central limit theorem states that the standard Gaussian distribution arises as the weak limit of the rescaled partial sums S n / p n of

More information

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

Online Appendices for Large Matching Markets: Risk, Unraveling, and Conflation Online Appendices for Large Matching Markets: Risk, Unraveling, and Conflation Aaron L. Bodoh-Creed - Cornell University A Online Appendix: Strategic Convergence In section 4 we described the matching

More information

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

Online Appendix to A search model of costly product returns by Vaiva Petrikaitė Online Appendix to A search model of costly product returns by Vaiva Petrikaitė 27 May A Early returns Suppose that a consumer must return one product before buying another one. This may happen due to

More information

arxiv: v1 [math.pr] 3 Sep 2010

arxiv: v1 [math.pr] 3 Sep 2010 Approximate results for a generalized secretary problem arxiv:1009.0626v1 [math.pr] 3 Sep 2010 Chris Dietz, Dinard van der Laan, Ad Ridder Vrije University, Amsterdam, Netherlands email {cdietz,dalaan,aridder}@feweb.vu.nl

More information

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

OPTIMIZING SEARCH ENGINES USING CLICKTHROUGH DATA. Paper By: Thorsten Joachims (Cornell University) Presented By: Roy Levin (Technion) OPTIMIZING SEARCH ENGINES USING CLICKTHROUGH DATA Paper By: Thorsten Joachims (Cornell University) Presented By: Roy Levin (Technion) Outline The idea The model Learning a ranking function Experimental

More information

Overall Plan of Simulation and Modeling I. Chapters

Overall Plan of Simulation and Modeling I. Chapters Overall Plan of Simulation and Modeling I Chapters Introduction to Simulation Discrete Simulation Analytical Modeling Modeling Paradigms Input Modeling Random Number Generation Output Analysis Continuous

More information

The Design of a Survival Study

The Design of a Survival Study The Design of a Survival Study The design of survival studies are usually based on the logrank test, and sometimes assumes the exponential distribution. As in standard designs, the power depends on The

More information

Biased Assimilation, Homophily, and the Dynamics of Polarization

Biased Assimilation, Homophily, and the Dynamics of Polarization Biased Assimilation, Homophily, and the Dynamics of Polarization Pranav Dandekar joint work with A. Goel D. Lee Motivating Questions Are we as a society getting polarized? If so, why? Do recommender systems

More information

Supervised Learning: Non-parametric Estimation

Supervised Learning: Non-parametric Estimation Supervised Learning: Non-parametric Estimation Edmondo Trentin March 18, 2018 Non-parametric Estimates No assumptions are made on the form of the pdfs 1. There are 3 major instances of non-parametric estimates:

More information

Unit 14: Nonparametric Statistical Methods

Unit 14: Nonparametric Statistical Methods Unit 14: Nonparametric Statistical Methods Statistics 571: Statistical Methods Ramón V. León 8/8/2003 Unit 14 - Stat 571 - Ramón V. León 1 Introductory Remarks Most methods studied so far have been based

More information

Lecture Slides - Part 1

Lecture Slides - Part 1 Lecture Slides - Part 1 Bengt Holmstrom MIT February 2, 2016. Bengt Holmstrom (MIT) Lecture Slides - Part 1 February 2, 2016. 1 / 36 Going to raise the level a little because 14.281 is now taught by Juuso

More information

PERCOLATION IN SELFISH SOCIAL NETWORKS

PERCOLATION IN SELFISH SOCIAL NETWORKS PERCOLATION IN SELFISH SOCIAL NETWORKS Charles Bordenave UC Berkeley joint work with David Aldous (UC Berkeley) PARADIGM OF SOCIAL NETWORKS OBJECTIVE - Understand better the dynamics of social behaviors

More information

A Optimal User Search

A Optimal User Search A Optimal User Search Nicole Immorlica, Northwestern University Mohammad Mahdian, Google Greg Stoddard, Northwestern University Most research in sponsored search auctions assume that users act in a stochastic

More information

Robust Testing and Variable Selection for High-Dimensional Time Series

Robust Testing and Variable Selection for High-Dimensional Time Series Robust Testing and Variable Selection for High-Dimensional Time Series Ruey S. Tsay Booth School of Business, University of Chicago May, 2017 Ruey S. Tsay HTS 1 / 36 Outline 1 Focus on high-dimensional

More information

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

Econometrics I KS. Module 2: Multivariate Linear Regression. Alexander Ahammer. This version: April 16, 2018 Econometrics I KS Module 2: Multivariate Linear Regression Alexander Ahammer Department of Economics Johannes Kepler University of Linz This version: April 16, 2018 Alexander Ahammer (JKU) Module 2: Multivariate

More information

Diffusion of Innovations in Social Networks

Diffusion of Innovations in Social Networks Daron Acemoglu Massachusetts Institute of Technology, Department of Economics, Cambridge, MA, 02139, daron@mit.edu Diffusion of Innovations in Social Networks Asuman Ozdaglar Massachusetts Institute of

More information

Redistribution Mechanisms for Assignment of Heterogeneous Objects

Redistribution Mechanisms for Assignment of Heterogeneous Objects Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar Dept of Computer Science and Automation Indian Institute of Science Bangalore, India sujit@csa.iisc.ernet.in Y Narahari Dept

More information

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

The Impact of Organizer Market Structure on Participant Entry Behavior in a Multi-Tournament Environment The Impact of Organizer Market Structure on Participant Entry Behavior in a Multi-Tournament Environment Timothy Mathews and Soiliou Daw Namoro Abstract. A model of two tournaments, each with a field of

More information

More on Input Distributions

More on Input Distributions More on Input Distributions Importance of Using the Correct Distribution Replacing a distribution with its mean Arrivals Waiting line Processing order System Service mean interarrival time = 1 minute mean

More information

Measuring relationships among multiple responses

Measuring relationships among multiple responses Measuring relationships among multiple responses Linear association (correlation, relatedness, shared information) between pair-wise responses is an important property used in almost all multivariate analyses.

More information

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

CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves Tim Roughgarden November 5, 2014 1 Pareto Curves and a Knapsack Algorithm Our next application of smoothed analysis is

More information

Welfare Undominated Groves Mechanisms

Welfare Undominated Groves Mechanisms Welfare Undominated Groves Mechanisms Krzysztof Apt 1,2, Vincent Conitzer 3, Mingyu Guo 3, and Evangelos Markakis 1 1 Centre for Math and Computer Science (CWI, Amsterdam, The Netherlands {apt, vangelis}@cwi.nl

More information

With high probability

With high probability With high probability So far we have been mainly concerned with expected behaviour: expected running times, expected competitive ratio s. But it would often be much more interesting if we would be able

More information

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

Cambridge Networks Day 2013 Sainsbury Laboratory University of Cambridge. Social Mechanisms in Real and Virtual Networks Cambridge Networks Day 2013 Sainsbury Laboratory University of Cambridge Social Mechanisms in Real and Virtual Networks Felix Reed-Tsochas CABDyN Complexity Centre & Oxford Martin School 7 May 2013 Outline

More information

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

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016 Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.

More information

Lecture 2 The Centralized Economy: Basic features

Lecture 2 The Centralized Economy: Basic features Lecture 2 The Centralized Economy: Basic features Leopold von Thadden University of Mainz and ECB (on leave) Advanced Macroeconomics, Winter Term 2013 1 / 41 I Motivation This Lecture introduces the basic

More information

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

CS 573: Algorithmic Game Theory Lecture date: April 11, 2008 CS 573: Algorithmic Game Theory Lecture date: April 11, 2008 Instructor: Chandra Chekuri Scribe: Hannaneh Hajishirzi Contents 1 Sponsored Search Auctions 1 1.1 VCG Mechanism......................................

More information

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

Microeconometria Day # 5 L. Cembalo. Regressione con due variabili e ipotesi dell OLS Microeconometria Day # 5 L. Cembalo Regressione con due variabili e ipotesi dell OLS Multiple regression model Classical hypothesis of a regression model: Assumption 1: Linear regression model.the regression

More information

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

Estimating the Dynamic Effects of a Job Training Program with M. Program with Multiple Alternatives Estimating the Dynamic Effects of a Job Training Program with Multiple Alternatives Kai Liu 1, Antonio Dalla-Zuanna 2 1 University of Cambridge 2 Norwegian School of Economics June 19, 2018 Introduction

More information

Detection theory 101 ELEC-E5410 Signal Processing for Communications

Detection theory 101 ELEC-E5410 Signal Processing for Communications Detection theory 101 ELEC-E5410 Signal Processing for Communications Binary hypothesis testing Null hypothesis H 0 : e.g. noise only Alternative hypothesis H 1 : signal + noise p(x;h 0 ) γ p(x;h 1 ) Trade-off

More information

Uncertainty and Disagreement in Equilibrium Models

Uncertainty and Disagreement in Equilibrium Models Uncertainty and Disagreement in Equilibrium Models Nabil I. Al-Najjar & Northwestern University Eran Shmaya Tel Aviv University RUD, Warwick, June 2014 Forthcoming: Journal of Political Economy Motivation

More information

Sequential Decisions

Sequential Decisions Sequential Decisions A Basic Theorem of (Bayesian) Expected Utility Theory: If you can postpone a terminal decision in order to observe, cost free, an experiment whose outcome might change your terminal

More information

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

The Beginning of Graph Theory. Theory and Applications of Complex Networks. Eulerian paths. Graph Theory. Class Three. College of the Atlantic Theory and Applications of Complex Networs 1 Theory and Applications of Complex Networs 2 Theory and Applications of Complex Networs Class Three The Beginning of Graph Theory Leonhard Euler wonders, can

More information

Low-Regret for Online Decision-Making

Low-Regret for Online Decision-Making Siddhartha Banerjee and Alberto Vera November 6, 2018 1/17 Introduction Compensated Coupling Bayes Selector Conclusion Motivation 2/17 Introduction Compensated Coupling Bayes Selector Conclusion Motivation

More information