David Easley and Jon Kleinberg November 29, 2010

Similar documents
Networks: Fall 2010 Homework 5 David Easley and Eva Tardos Due November 11, 2011

Networks: Spring 2010 Homework 3 David Easley and Jon Kleinberg Due February 26, 2010

Sponsored Search Markets

MATH 240: Problem Set 4

Spring 06 Assignment 4: Game Theory and Auctions

Networked Life (CSE 112)

Advanced Topics in Computer Science 2. Networks, Crowds and Markets. Fall,

Exam #2 (100 Points Total) Answer Key

Do not open this exam until told to do so. Solution

Intro to Algorithmic Economics, Fall 2013 Lecture 1

Exam #2 (100 Points Total)

THE UNIVERSITY OF MELBOURNE MELBOURNE BUSINESS SCHOOL MANAGERIAL ECONOMICS. John Asker. Final Exam: December 2006

14.03 Exam 3 Fall 2000 DO NOT OPEN THIS EXAM UNTIL TIME IS ANNOUNCED!

This paper is not to be removed from the Examination Halls

Competitive Markets. Jeffrey Ely. January 13, This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License.

Final Exam cheat sheet

Chapter Fourteen. Topics. Game Theory. An Overview of Game Theory. Static Games. Dynamic Games. Auctions.

Solution to Midterm 2 Lecture 1 (9:05-9:55) 50 minutes Econ 1101: Principles of Microeconomics Thomas Holmes November 13, 2006

Copyright (C) 2001 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of version 1 of the

Econ 3542: Experimental and Behavioral Economics Exam #1 Review Questions

Economics 11 Caltech Spring 2010

Algorithmic Game Theory

Professor Christina Romer. LECTURE 3 SUPPLY AND DEMAND FRAMEWORK January 24, 2017

INTERMEDIATE MICROECONOMICS (EC201)

Total /18 /18 /16 /15 /15 /18 /100. Economics 142 Final Exam NAME Vincent Crawford Winter 2008

Game Theory and Economics Prof. Dr. Debarshi Das Department of Humanities and Social Sciences Indian Institute of Technology, Guwahati

Solution to Practice Exam, Spring 2004

Topics in ALGORITHMIC GAME THEORY *

Economics 155/Earth Systems 112 Spring Final Exam

Unit 6: Non-Competitive Markets

VCG in Theory and Practice

Firms and Markets (Summer 2007)

Game theory (Sections )

Supplimentary material for Research at the Auction Block: Problems for the Fair Benefits Approach to International Research

Note on webpage about sequential ascending auctions

Instructor: Wooyoung Lim Games and Strategic Behavior (MBA & MSc Econ) Office: LSK 6080

Chapter 13. Microeconomics. Monopolistic Competition: The Competitive Model in a More Realistic Setting

Analyze different types of non zero sum games. Hawk vs. Dove game. Advertising problem. Problem of companies polluting the environment.

This paper is not to be removed from the Examination Halls

This paper is not to be removed from the Examination Halls

Name: I pledge to obey the Duke University Honor Code during this exam. ECON201 - Final Exam - Spring 2018 Professor Chelsea Garber

March. 2 It is even more sophisticated than this since Google has quite a bit of information about the

Public Advertisement Broker Markets.

Chapter 1 Basic Microeconomic Principles

COMP/MATH 553 Algorithmic Game Theory Lecture 8: Combinatorial Auctions & Spectrum Auctions. Sep 29, Yang Cai

Practice Problems 2. State Price Elasticity Massachussets $ Ohio $ Utah $

Economics of Managerial Decision Making (MGEC 611) SAMPLE EXAM

Strategic Ignorance in the Second-Price Auction

Final Exam Solutions

ECMC02H Intermediate Microeconomics - Topics in Price Theory

Econ 101A Solutions for Final exam - Fall 2006

14.01 Principles of Microeconomics, Fall 2007 Chia-Hui Chen November 7, Lecture 22

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Fall Game theory (PR 13) Module 5 Oct.

What Is Covered. Econ 2 Final Exam. The Big Concepts. An Outline of Topics Covered In Econ 2

Economics : Principles of Microeconomics Spring 2014 Instructor: Robert Munk April 24, Final Exam

Economics 101 Fall 2017 Answers to Homework 5 Due:12/12/17

Final Exam Economics 304K Professor R. P. McAfee University of Texas at Austin

Exam #1 2/22/17. Problem Number Points

ECO 300 MICROECONOMIC THEORY Fall Term 2005 FINAL EXAMINATION

Professor Christina Romer. LECTURE 9 MONOPOLY February 13, 2018

Choosing Products in Social Networks

Econ 1101 Spring 2013 Week 2. Section 038 1/30/2013

KEELE UNIVERSITY MOCK EXAMINATION PAPER ECO MANAGERIAL ECONOMICS II

Game Theory Exam, June 2015

Test Codes: QEA and QEB (Both are of 'Descriptive' type) (Junior Research Fellowship in Quantitative Economics)

LECTURE February Tuesday, February 19, 13

q S pq S cq S. where q is the total amount produced/consumed. There are two representative firms that maximizes their profits, max pq 1 c 2 q2 1 q 1

Economics Department 2009 Honors General Exam

ECS 253 / MAE 253, Lecture 13 May 10, I. Games on networks II. Diffusion, Cascades and Influence

Department of Economics. Harvard University. Spring Honors General Exam. April 6, 2011

Game Theory: Spring 2017

Syllabus. Firms and Markets Professor Paul Scott Office: KMC Course description

Market Structure. Monopolistic Oligopoly. By Asst. Prof. Kessara Thanyalakpark, Ph.D.

This is an 80-minute, 80 point CLOSED BOOK exam. Answer all questions.

CSE 255 Lecture 14. Data Mining and Predictive Analytics. Hubs and Authorities; PageRank

Bidding for Sponsored Link Advertisements at Internet

Common-Pool Resources (Ch 34) and Public Goods (Ch 36)

Combinatorial Auctions

Firms and Markets (Spring 2010) [B and B P]

VALUE OF SHARING DATA

Chapter 13 Outline. Challenge: Intel and AMD s Advertising Strategies. An Overview of Game Theory. An Overview of Game Theory

Auction Theory An Intrroduction into Mechanism Design. Dirk Bergemann

Recap Beyond IPV Multiunit auctions Combinatorial Auctions Bidding Languages. Multi-Good Auctions. CPSC 532A Lecture 23.

Price of anarchy in auctions & the smoothness framework. Faidra Monachou Algorithmic Game Theory 2016 CoReLab, NTUA

5/2/2016. Intermediate Microeconomics W3211. Lecture 25: Recap 2. The Story So Far. Organization for the Week. Introduction

DO NOT OPEN THE QUESTION PAPER UNTIL INSTRUCTED TO DO SO BY THE CHIEF INVIGILATOR. MICROECONOMICS TWO HOURS (2 Hours)

Microeconomics LESSON 6 ACTIVITY 41

A Survey of Sponsored Search Advertising in Large Commercial Search Engines. George Trimponias, CSE

The Need for Information

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game theory (PR 13) Competitive strategies.

1.. Consider the following multi-stage game. In the first stage an incumbent monopolist

DO NOT OPEN THIS BOOKLET OR TURN IT OVER [until told to do so]

Lecture 7 - Auctions and Mechanism Design

ANSWER OUTLINE. DATE: Thursday, March 12, 11:00am Econ 308, Spring 2009

Experimental Economics, Environment and Energy

The Need for Information

SUBJ SCORE # Version B: Page 1 of 10. (signature)

EE5721 FINAL EXAM MAY 11, 2011 NAME PLEASE DO NOT ENTER YOUR ID NUMBER

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

Final Quiz Review: Solutions

Transcription:

Networks: Spring 2010 Practice Final Exam David Easley and Jon Kleinberg November 29, 2010 The final exam is Friday, December 10, 2:00-4:30 PM in Barton Hall (Central section). It will be a closed-book, closed-notes exam. The final will be cumulative, in that it will draw from all parts of the course, both before and after the midterm. The best guide to the coverage of the exam is the contents of the course lectures; it will also be useful to review the homeworks and the readings. To help in studying, we are providing the following practice final exam below. It is structured to approximately resemble the real final, although of course the actual questions on the real final may cover topics from the course that are not explicitly the focus of any question here. The practice final questions are not meant to be handed in; rather, we will discuss them at the final exam review sessions and during office hours. Solutions to the practice final will be posted after the review sessions. Office hours will be held at their usual times up through the time of the final exam. The review sessions are Tuesday, December 7 at 3:00 PM in Goldwin Smith 132 (HEC Auditorium), and Wednesday, December 8 at 2:00 PM in Goldwin Smith G76 (Lewis Auditorium). (1) Suppose a search engine has two ad slots that it can sell. Slot a has a clickthrough rate of 10 and slot b has a clickthrough rate of 5. There are three advertisers who are interested in these slots. Advertiser x values clicks at 3 per click, advertiser y values clicks at 2 per click, and advertiser z values clicks at 1 per click. (a) Compute the socially optimal allocation and the VCG prices for it. Give a brief explanation for your answer. (b) Take the prices for slots a and b that you computed in part (a), together with a third slot c having clickthrough rate 0 and price of 0. Viewing this as a matching market with items a, b, and c, and buyers x, y, and z, are the prices market-clearing? Explain why or why not. (2) In the payoff matrix below the rows correspond to player A s strategies and the columns correspond to player B s strategies. The first entry in each box is player A s payoff and the second entry is player B s payoff. Player A Player B x y x 1, 1 0, 1 y 1, 0 2, 2 (a) Find all pure strategy Nash equilibria.

(b) Find all Evolutionarily Stable (pure) strategies. (c) Briefly explain how the sets of predicted outcomes (in parts (a) and (b)) relate to each other. (3) Suppose a network exchange theory experiment is run on the graph depicted in Figure 1 using the one-exchange rule with $10 placed on each edge. a b c d Figure 1: A 4-node path in a network exchange theory experiment. (a) After running the experiment for a while, the experimenters vary the network: they introduce two further nodes e and f, and bring in additional people to play the roles of these nodes. Node e is attached by a single edge to node b, while node f is attached by a single edge to node c. A new round of experiments is performed with this new six-node network. Explain what you think will happen to the relative power of the participants, compared to the situation in the original four-node network. Give a brief (1-3 sentence) explanation for your answer. You do not need to give actual numbers for the amounts of money the nodes would receive. (b) The experimenters now decide to vary the network again. They keep the same set of nodes, but now they add an edge linking e directly to f. (The existing edges continue to remain in place as well.) A new round of experiments is performed with this modified six-node network. Explain what you think will happen to the relative power of the participants, compared to the situation on the previous six-node network in part (a). Give a brief (1-3 sentence) explanation for your answer. You do not need to give actual numbers for the amounts of money the nodes would receive. (4) (a) Suppose you are one of three people voting on a set of four alternatives named A, B, C, and D. The Borda Count will be used as the voting system. The other two voters have the rankings D 1 C 1 A 1 B D 2 B 2 A 2 C You are voter 3 and would like alternative A to appear first in the group ranking, as determined by the Borda Count. Can you construct an individual ranking for yourself so that this will be the result? If so, explain how you would choose your individual ranking; if not, explain why it is not possible.

(b) Let s consider the same question, but with different rankings for the other two voters, as follows: D 1 A 1 C 1 B B 2 D 2 A 2 C Again, as voter 3, you would like alternative A to appear first in the group ranking determined by the Borda Count. Can you construct an individual ranking for yourself so that this will be the result? If so, explain how you would choose your individual ranking; if not, explain why it is not possible. (5) Imagine that you re advising a group of agricultural officials who are investigating measures to control the outbreak of an epidemic in its early stages within a livestock population. On short notice, they are able to try controlling the extent to which the animals come in contact with each other, and they are also able to introduce higher levels of sanitization to reduce the probability that one animal passes the disease to another. The current situation is that each animal comes into contact with 50 other animals, and the probability that an infected animal passes the disease to another animal is.04. The officials are considering two proposals for how to control the outbreak. If they follow Proposal 1, they would be able to reduce the number of animals that each animal comes in contact with from 50 to 35, and the probability that an infected animal passes the disease to another animal from.04 to.03. If they follow Proposal 2, they would be able to reduce the number of animals that each animal comes in contact with from 50 to 45, and the probability that an infected animal passes the disease to another animal from.04 to.02. The officials observe that Proposal 1 does better at reducing the amount of contact, while Proposal 2 does better at reducing the probability of spread from one animal to another; they have not done any further analysis beyond this observation, and the general feeling among the officials is that the two proposals offer competing advantages, and overall they would do comparably well at controlling the outbreak. Do you agree with the officials that the two proposals would do comparably well at controlling the outbreak? If so, explain why. If not, explain why not, and also say (as part of your explanation) which proposal you would advise the officials to follow. (6) (a) In the set of Web pages depicted in Figure 2, explain why the indicated set of numbers do not form an equilibrium set of PageRank values under the Basic PageRank Update Rule. (b) Give an equilibrium set of PageRank values under the Basic PageRank Update Rule for this network, together with an explanation for your answer. (7) Consider the model of the market for lemons from class. Suppose that there are three types of used cars: good ones, bad ones and lemons, and that sellers know which type

1/4 1/8 1/16 A B C D E 1/4 1/16 F 1/4 Figure 2: A network of Web pages. of car they have. Buyers do not know which type of car a seller has. The fraction of used cars of each type is 1 and buyers know this. Let s suppose that a seller who has a good car 3 values it at $8,000, a seller with a bad car values it at $5,000 and a seller with a lemon values the lemon at $1,000. A seller is willing to sell his car for any price greater than or equal to his value for the car; the seller is not willing to sell the car at a price below the value of the car. Buyers values for good cars, bad cars and lemons are, $9,000, $8,000 and $4,000, respectively. As in class we will assume that buyers are risk-neutral; that is, they are willing to pay their expected value of a car. (a) Is there an equilibrium in the used-car market in which all types of cars are sold? Explain briefly. (b) Is there an equilibrium in the used-car market in which only bad quality cars and lemons are sold? Explain briefly. (c) Is there an equilibrium in the used-car market in which only lemons are sold? Explain briefly. (8) Consider the network depicted in Figure 3; suppose that each node starts with the behavior B, and each node has a threshold of q = 1 for switching to behavior A. 2 (a) Now, let e and f form a two-node set S of initial adopters of behavior A. If other nodes follow the threshold rule for choosing behaviors, which nodes will eventually switch to A? (b) Find a cluster of density greater than 1 q = 1 in G S that blocks behavior A 2 from spreading to all nodes, starting from S, at threshold q.

c d e f g h i j k Figure 3: (9) A seller will run a second-price, sealed-bid auction for an object. There are two bidders, a and b, who have independent, private values v i which are either 0 or 1. For both bidders the probabilities of v i = 0 and v i = 1 are each 1/2. Both bidders understand the auction, but bidder b sometimes makes a mistake about his value for the object. Half of the time his value is 1 and he is aware that it is 1; the other half of the time his value is 0 but occasionally he mistakenly believes that his value is 1. Let s suppose that when b s value is 0 he acts as if it is 1 with probability 1 and as if it is 0 with probability 1. So in effect 2 2 bidder b sees value 0 with probability 1 and value 1 with probability 3. Bidder a never makes 4 4 mistakes about his value for the object, but he is aware of the mistakes that bidder b makes. Both bidders bid optimally given their perceptions of the value of the object. Assume that if there is a tie at a bid of x for the highest bid the winner is selected at random from among the highest bidders and the price is x. (a) Is it bidding his true value still a dominant strategy for bidder a? Explain briefly (b) What is the seller s expected revenue? Explain briefly. (10) In this question we consider a variation on the model of information cascades from class. Suppose that there is a new technology which individuals sequentially decide to adopt or reject. Let s suppose that anyone who adopts the new technology receives either a positive or a negative payoff from using the new technology. Unlike the model used in class, these payoffs are random and have the property that the average payoff is positive if the technology is Good, and negative if the technology is Bad. Anyone who decides to reject the new technology always receives a payoff of exactly zero. As in the model used in class, each person receives a private signal about the technology and observes the actions of all those who chose previously. However, unlike the model used in class, each person is also told the payoffs received by each of those who moved

previously. [One interpretation of this is that a government agency collects information about individuals experiences and distributes it for free as a public service.] (a) Suppose that the new technology is actually Bad. How does this new information about payoffs (the payoffs received by each of those who moved previously) affect the potential for an information cascade of choices to adopt the new technology to form and persist? [You do not need to write a proof. A brief argument is sufficient.] (b) Suppose that the new technology is actually Good. Can an information cascade of rejections of the new technology occur? Explain briefly.