Topics Applications Auctions Bargaining Experimental Economics Forum General Equilibrium Napster other Other Topics Prisoners Dilemma Zero Sum Games
| | Most Recent Posts
Not sure why the image I uploaded didn't seem to appear.
game is described as such:
1 can play U, M or D.
In response each of 1's action, 2 can play u or d.
U,u - 6,8
U,d - 7,4
M,u - 9,5
M,d - 7,4
D,u - 4,6
D,d - [View full text and thread]
Predict what the players would do in this game if Player 2 was in fact not in a
position to observe Player 1’s choice between U, M and D
My answer was that although player 2 wouldn't know what 1 would play, he would prepare a best [View full text and thread]
Hello I was wondering if anyone could offer any guidance on this question mainly part b thank you in advance!
Consider the following second-price sealed-bid private value auction with two bidders, n=2. Each bidder's private value is [View full text and thread]
Hello I was wondering if anyone could offer any guidance on this question mainly part b thank you in advance!
Consider the following second-price sealed-bid private value auction with two bidders, n=2. Each bidder's private value is [View full text and thread]
[View full text and thread]
[View full text and thread]
Rules. All players can walk, and run. walking is at a rate of 1 ft per .5 seconds, running at a rate of 3 ft per .5 seconds. No distinction between running facing backwards or forwards. All players are 3 ft apart with a 90% chance [View full text and thread]
[View full text and thread]
[View full text and thread]
Dear friends,
I have troubles solving the following problem:
There are a taxpayer and an inspector. The taxpayer receives income y, drawn from some distribution and decides her tax declaration size - d.
The inspector receives [View full text and thread]
[View full text and thread]
There are 6 NE in total, 4 pure and 2 mixed. For (seller,buyer), the pure NE are (1,1), (2,2), (3,1) and (3,3), which you can easily check by making a table and underlining best responses.
As for the mixed NE, the buyer should also [View full text and thread]
There are 6 NE in total, 4 pure and 2 mixed. For (seller,buyer), the pure NE are (1,1), (2,2), (3,1) and (3,3), which you can easily check by making a table and underlining best responses.
As for the mixed NE, the buyer should also [View full text and thread]
It is written that computing pure Nash equilibria in congestion games remains PLS-complete also when we restrict to affine delay functions. That is for dr(x) = arx + brx with, ar, br >= 0. Why is that? [View full text and thread]
Hey,
Would be amazing if somebody could solve this problem for me. I have no clue, to be honest. Here it is:
A seller and a buyer try to agree on the price of a Picasso painting. In the
rest of this exercsie, all the values and [View full text and thread]
Hey,
Would be amazing if somebody could solve this problem for me. I have no clue, to be honest. Here it is:
A seller and a buyer try to agree on the price of a Picasso painting. In the
rest of this exercsie, all the values and [View full text and thread]
Hey,
Would be amazing if somebody could solve this problem for me. I have no clue, to be honest. Here it is:
A seller and a buyer try to agree on the price of a Picasso painting. In the
rest of this exercsie, all the values and [View full text and thread]
Consider a classic signaling game (2 types, 2 actions) à la Spence. Suppose furthermore that there are two equilibria: one pooling, one separating. In the pooling eq., say, both types of senders send "Low". In the separating, the [View full text and thread]
Consider a classic signaling game (2 types, 2 actions) à la Spence. Suppose furthermore that there are two equilibria: one pooling, one separating. In the pooling eq., say, both types of senders send "Low". In the separating, the [View full text and thread]
Hi I'm dealing with a problem that has a slight twist to the lion and sheep problem. The problem is as follows
Lions - (1,2 ....K)
Sheeps - (1,2 ....K-1)
Lion choose to ( Eat, not eat) sheep
If k-th lion choose to eat, he becomes [View full text and thread]
|