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

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

Single unit auction, An auction during which just one item is on the market...

An auction during which just one item is on the market for sale. Procedures embody English, Dutch, and sealed bid auctions. When multiple units are sold in one auction, the auction

Finding Equilibrium in Game Theory, This is Case of Competitive Games. ...

This is Case of Competitive Games. Player 2 L R Player 1 L (60,40) (70,30) R (65,35) (60,40) Are either have dominant st

Positive add, In a positive add game, the combined payoffs of all players a...

In a positive add game, the combined payoffs of all players aren't identical in each outcome of the sport. This differs from constant add (or zero add) games during which all outco

Perfect data, A sequential game is {one of|one among|one in all|one amongst...

A sequential game is {one of|one among|one in all|one amongst|one in each of} excellent data if just one player moves at a time and if every player is aware of each action of the p

Cournot Game, I have a problem with an exercise about Cournot game. It is v...

I have a problem with an exercise about Cournot game. It is very complex and it is composed by different question and it is impossible for me to write the complete text. I need som

Game tree, A game tree (also referred to as the in depth form) may be a gra...

A game tree (also referred to as the in depth form) may be a graphical illustration of a sequential game. It provides data concerning the players, payoffs, strategies, and also the

Proxy bidder , A proxy bidder represents the interests of a bidder not phys...

A proxy bidder represents the interests of a bidder not physically gift at the auction. Typically, the bidder can inform his proxy of the most quantity he's willing to pay, and als

Find pure nash equilibria, Find Pure Nash Equilibria 1. Consider a two-...

Find Pure Nash Equilibria 1. Consider a two-player game in which player 1 chooses the strategy x 1 from the closed interval [-1, 1] while player 2 chooses the strategy x 2 fr

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