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

Bidding ring, A set of colluding bidders. Ring participants agree to rig bi...

A set of colluding bidders. Ring participants agree to rig bids by agreeing not to bid against each other, either by avoiding the auction or by placing phony (phantom) bids.

Perfect data, A sequential game is one among one in all if just one player ...

A sequential game is one among one in all if just one player moves at a time and if every player is aware of each action of the players that moved before him at every purpose. Tech

Bidder, An auction associates who submits offers (or bids) to sale or buy  ...

An auction associates who submits offers (or bids) to sale or buy  the goods being auctioned.

Paradox of identification, Discussion in the preceding section suggests tha...

Discussion in the preceding section suggests that if we want to measure a given hnction belonging to a simultaneous-equations model, the hnction must be fairly stable over the samp

Pure strategy, A pure strategy defines a selected move or action that a pla...

A pure strategy defines a selected move or action that a player can follow in each potential attainable state of affairs in a very game. Such moves might not be random, or drawn fr

Variable add, In a Variable add game, the add of all player's payoffs diffe...

In a Variable add game, the add of all player's payoffs differs counting on the methods they utilize. this can be the other of a continuing add game during which all outcomes invol

First worth auction, An auction during which the bidder who submitted the v...

An auction during which the bidder who submitted the very best bid is awarded the item being sold and pays a worth equal to the number bid. Alternately, in a very procurement aucti

Assurance game, Assurance game Scenario "Assurance game" may be a generi...

Assurance game Scenario "Assurance game" may be a generic name for the sport a lot of commonly called "Stag Hunt." The French thinker, Jean Jacques Rousseau, presented the subse

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

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