Showing 1 - 10 of 439
In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...
Persistent link: https://www.econbiz.de/10010284043
We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the 'same or better reply' correspondence (CUSOBR set) that...
Persistent link: https://www.econbiz.de/10010284068
In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...
Persistent link: https://www.econbiz.de/10008568315
We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...
Persistent link: https://www.econbiz.de/10008587794
In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...
Persistent link: https://www.econbiz.de/10013142432
We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...
Persistent link: https://www.econbiz.de/10013142570
We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...
Persistent link: https://www.econbiz.de/10008688945
In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...
Persistent link: https://www.econbiz.de/10008688967
Does gender play a role in the context of team work? Our results based on areal-effort experiment suggest that performance depends on the composition of theteam. We find that female and male performance di¤er most in mixed teams withrevenue sharing between the team members, as men put in...
Persistent link: https://www.econbiz.de/10005861876
It is well known that the rock-paper-scissors game has no pure saddle point. Weshow that this holds more generally: A symmetric two-player zero-sum game hasa pure saddle point if and only if it is not a generalized rock-paper-scissors game.Moreover, we show that every finite symmetric...
Persistent link: https://www.econbiz.de/10009248997