The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph … provide an O(nm)-time algorithm that given a triangle-free graph G together with four vertices outputs either an induced tree …

replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given … finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm … is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006). …

their income - the higher the risk aversion, the more stable the cooperatives and the lower the segregation. Learning can … high or low-risk, and while they are learning, they tend to create cooperatives that can last. Eventually we worked on the …

private agents are gradually learning their uncertain environment. When agents update their beliefs about the parameters that … under adaptive learning are significantly larger than under rational expectations. In our benchmark case calibrated using US … data on leverage, debt-to-GDP and land value-to-GDP ratios for 1996Q1-2008Q4, learning amplifies leverage shocks by a …

learning algorithm is recursive least squares, long memory arises when the coefficient on expectations is sufficiently large … data when the agent's beliefs about the model are updated through linear learning algorithms. We find that learning in this … endogenous variable is determined exogenously. Finally, this property of learning is used to shed light on some well …