Showing 1 - 10 of 297
Persistent link: https://www.econbiz.de/10001726443
Persistent link: https://www.econbiz.de/10001726461
In many economic and social contexts, individual players choose their partners and also decide ona mode of behavior in interactions with these partners. This paper develops a simple model toexamine the interaction between partner choice and individual behavior in games of coordination.An...
Persistent link: https://www.econbiz.de/10011304395
This paper develops a simple model to examine the interaction between partner choice and individual behavior in games of coordination. An important ingredient of our approach is the way we model partner choice: We suppose that a player can establish ties with other players by unilaterally...
Persistent link: https://www.econbiz.de/10014093656
Persistent link: https://www.econbiz.de/10003651828
Persistent link: https://www.econbiz.de/10003651833
This paper models the dynamic process through which a large society may succeed in building up its social capital by establishing a stable and dense pattern of interaction among its members. In the model, agents interact according to a collection of infinitely repeated Prisoner's Dilemmas played...
Persistent link: https://www.econbiz.de/10011591665
This paper models the dynamic process through which a large society may succeed in building up its "social capital" by establishing a stable and dense pattern of interaction among its members. In the model, agents interact according to a collection of infinitely repeated Prisoner's Dilemmas...
Persistent link: https://www.econbiz.de/10014076137
We propose a stylized model of a problem-solving organization whose internal communication structure is given by a fixed network. Problems arrive randomly anywhere in this network and must find their way to their respective "specialized solvers" by relying on local information alone. The...
Persistent link: https://www.econbiz.de/10014029858
We analyze input-output matrices for a wide set of countries as weighted directed networks. These graphs contain only 47 nodes, but they are almost fully connected and many have nodes with strong self-loops. We apply two measures: random walk centrality and one based on count-betweenness. Our...
Persistent link: https://www.econbiz.de/10013137865