代做Economics 142 Practice Questions II帮做Python语言程序

Practice Questions II

Economics 142

December 5, 2024

1. Choose the correct letter for each question.

(a) When one good is sold to one of the N buyers with value v1 > v2 > ... > vN > 0...

A. The buyer-optimal market clearing price is vN .

B. The buyer-optimal market-clearing price is v2.

C. The buyer-optimal market-clearing price is v1.

D. The buyer-optimal market-clearing price and the seller-optimal market-clearing price is the same.

(b) Consider an arbitrary bipartite network with N unit-sellers and N unit-buyers with heterogeneous values. They can trade only when they are connected. If we add one more buyer who is connected to every seller with value viN+1 > 0 for i = 1, ..., N, then....

A. All original N buyers must be weakly better off given the new buyer-optimal market clearing prices.

B. Some buyer must be strictly worse off given the new buyer-optimal market clearing prices.

C. The total values at the efficient assignment must increase weakly.

D. The total values at the efficient assignment must decrease weakly.

(c) Suppose that θ is either 1 and −1 with equal probability and let s ∈ {s1, ..., sm} be a signal about θ, which follows some conditional distribution Pr[s = si |θ = z], z = 1, −1.

A. It is possible that the posterior belief Pr[θ = 1|s = si ] for θ = 1 is strictly larger than 0.5 for every i = 1, ..., m.

B. It is possible that the posterior belief Pr[θ = 1|s = si ] is strictly strictly smaller than 0.5 for every i = 1, ..., m.

C. If the posterior belief Pr[θ = 1|s = si ] is strictly larger than 0.5 for some si , then it must be strictly smaller than 0.5 given some other sj ≠ si .

D. The expected posterior belief E[Pr[θ = 1|s = si ]] = P m i=1 Pr[θ = 1|s = si ] Pr[s = si ] can be be different from 0.5.

(d) Consider a star network with n + 1 nodes. Assume that each node i observes a noisy signal xi(0) = θ + ϵi of some hidden state θ ∈ R, where ϵi is i.i.d. noise with mean 0. Let 0 be the center node. Assume that every node updates its x by taking the averages of x of its own and its neightbors (x0(t + 1) = n+1/Pni=0xi(t) for the center node and xi(t + 1) = 2/x0(t)+xi(t) for other i = 0). Let xn(∞) be the consensus that is reached as t → ∞.

A. Given each θ, xn(∞) converges to some number as n → ∞ and may be biased (i.e. limn→∞ xn(∞) ≠ θ).

B. Given each θ, xn(∞) converges to θ.

C. Given each θ, xn(∞) is random even as n → ∞ and may be biased (i.e. E[limn→∞ xn(∞)] ≠ θ).

D. Given each θ, xn(∞) is random even as n → ∞ and is unbiased (i.e. E[limn→∞ xn(∞)] = θ).

2. Various types of memberships for some subscription service are on sale. Suppose that currently there is only one available slot of a special mem-bership with service level xs, then there are two slots for regular member-ships of service level xr ∈ (0, xs). Suppose that three people j = 1, 2, 3 are interested in these three memberships. Assume that j values service x by θjx, where θ1 > θ2 > θ3 > 0.

Answer the following questions.

(a) What is the most efficient assignment/allocation of the three mem-berships to these three people?

(b) Find the smallest (i.e. buyer-optimal) market-clearing prices.

(c) Find the largest (i.e. seller-optimal) market-clearing prices.

(d) Suppose that one regular membership is replaced with a upgraded membership“regular+”. The service xr+ for a regular+ member-ship is between xr and xs. Find the buyer-optimal market-clearing prices and the seller-optimal market clearing prices and compare them to your answer for (c). (We assume that one regular mem-bership is withdrawn so that there are three slots of memberships. As an exercise, do the same question assuming that two regular memberships are still available (so there are four membership slots available)).

3. Consider the model of observational learning where people decide whether to adopt a new technology or not sequentially. Each person decides to adopt a new strategy or stick to the old technology one by one after observing some information about the new technology and ob-serving the actions of the preceding people. There are two possible states: the new technology is pathbreaking (θ = P) with probability p or a failure (θ = F) with probability 1 − p. Each person’s pay-off from adopting a new technology is v + 80 if the state is P and v − 120 if the state is F, where v is the payoff from sticking to the old technology. Each person i observes a (independent and identically distributed) signal si ∈ {pb, f}, which is correct with probability 2/3 (i.e. Pr[si = p|θ = P] = Pr[si = f|θ = F] = 2/3).

(a) If the first person observes s1 = f, what is her posterior belief for θ = P and θ = F?

(b) For some range of initial belief p, everyone ignores her own signal and chooses the same action. Characterize such range of p.

(c) Suppose that p = 1/2. What is the probability that the tth person for every t ≥ 3 choose the same action independent of their own information?

(d) When p = 1/2, what is the probability that a sequence of people converge to choose the same bu a wrong choice?






热门主题

课程名

mktg2509 csci 2600 38170 lng302 csse3010 phas3226 77938 arch1162 engn4536/engn6536 acx5903 comp151101 phl245 cse12 comp9312 stat3016/6016 phas0038 comp2140 6qqmb312 xjco3011 rest0005 ematm0051 5qqmn219 lubs5062m eee8155 cege0100 eap033 artd1109 mat246 etc3430 ecmm462 mis102 inft6800 ddes9903 comp6521 comp9517 comp3331/9331 comp4337 comp6008 comp9414 bu.231.790.81 man00150m csb352h math1041 eengm4100 isys1002 08 6057cem mktg3504 mthm036 mtrx1701 mth3241 eeee3086 cmp-7038b cmp-7000a ints4010 econ2151 infs5710 fins5516 fin3309 fins5510 gsoe9340 math2007 math2036 soee5010 mark3088 infs3605 elec9714 comp2271 ma214 comp2211 infs3604 600426 sit254 acct3091 bbt405 msin0116 com107/com113 mark5826 sit120 comp9021 eco2101 eeen40700 cs253 ece3114 ecmm447 chns3000 math377 itd102 comp9444 comp(2041|9044) econ0060 econ7230 mgt001371 ecs-323 cs6250 mgdi60012 mdia2012 comm221001 comm5000 ma1008 engl642 econ241 com333 math367 mis201 nbs-7041x meek16104 econ2003 comm1190 mbas902 comp-1027 dpst1091 comp7315 eppd1033 m06 ee3025 msci231 bb113/bbs1063 fc709 comp3425 comp9417 econ42915 cb9101 math1102e chme0017 fc307 mkt60104 5522usst litr1-uc6201.200 ee1102 cosc2803 math39512 omp9727 int2067/int5051 bsb151 mgt253 fc021 babs2202 mis2002s phya21 18-213 cege0012 mdia1002 math38032 mech5125 07 cisc102 mgx3110 cs240 11175 fin3020s eco3420 ictten622 comp9727 cpt111 de114102d mgm320h5s bafi1019 math21112 efim20036 mn-3503 fins5568 110.807 bcpm000028 info6030 bma0092 bcpm0054 math20212 ce335 cs365 cenv6141 ftec5580 math2010 ec3450 comm1170 ecmt1010 csci-ua.0480-003 econ12-200 ib3960 ectb60h3f cs247—assignment tk3163 ics3u ib3j80 comp20008 comp9334 eppd1063 acct2343 cct109 isys1055/3412 math350-real math2014 eec180 stat141b econ2101 msinm014/msing014/msing014b fit2004 comp643 bu1002 cm2030
联系我们
EMail: 99515681@qq.com
QQ: 99515681
留学生作业帮-留学生的知心伴侣!
工作时间:08:00-21:00
python代写
微信客服:codinghelp
站长地图