Game 3 bargaining, Game Theory

Assignment Help:

GAME 3 Bargaining


Two players A and B are chosen. Player A offers a split of a dollar (whole dimes only). If B agrees, both get paid the agreed coins and the game is over. If B refuses, it is B’s turn but now the sum is only 80 cents. If A accepts B’s offer, the two get paid the agreed coins. If A refuses, the game is over and neither gets anything.


Do this five times in succession with different pairs and the second-round totals falling successively to 70, 60, 50, and 40 cents. Keep a record of the successive outcomes.Again hold a brief discussion. The aim is to get the students to start thinking about rollback and subgame perfectness and,if the students understand these strategies but still don’t play them, why they don’t. Also, consider how the discrepancy changes with the second-round fraction.


Related Discussions:- Game 3 bargaining

Simultaneous move games with mixed strategies, This chapter introduces mixe...

This chapter introduces mixed strategies and the methods used to solve for mixed strategy equilibria. Students are likely to accept the idea of randomization more readily if they t

Payoff, In any game, payoffs are numbers that represent the motivations of ...

In any game, payoffs are numbers that represent the motivations of players. Payoffs might represent profit, quantity, "utility," or different continuous measures (cardinal payoffs)

Evolutionary game theory, Evolutionary game theory provides a dynamic frame...

Evolutionary game theory provides a dynamic framework for analyzing repeated interaction. Originally modeled when "natural models" of fitness, a population might contains folks gen

Write a bouncing ball video game, Write a bouncing ball video game. The gam...

Write a bouncing ball video game. The game is similar to the one described and depicted in The balls bounce within the screen where the two horizontal walls are fixed. The two v

Order condition for identification, This condition is based on a counting ...

This condition is based on a counting rule of the variables included and excluded from the particular equation. It is a necessary but no sufficient condition for the identi

Backward induction, Backward induction is an iterative procedure for resolv...

Backward induction is an iterative procedure for resolving finite general form or sequential games. First, one decides the finest policy of the player who makes the last move of th

non-credible threat , A non-credible threat may be a threat created by a p...

A non-credible threat may be a threat created by a player in a very Sequential Game which might not be within the best interest for the player to hold out. The hope is that the thr

Volunteer''s dilemma , Scenario As described by William Poundstone, imag...

Scenario As described by William Poundstone, imagine that you just notice that electricity has gone out for your entire neighborhood. the electrical company can send somebody to

Blind auction, Another term for a preserved bid auction in which bidders si...

Another term for a preserved bid auction in which bidders simultaneously submit bids to the auctioneer with no knowledge of the amount bid by other member. Usually, the uppermost b

Reverse auction, While ancient auctions involve one seller and plenty of co...

While ancient auctions involve one seller and plenty of consumers, a reverse auction typically involves several sellers and one buyer. for instance, procurement auctions are used t

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd