Institutions for Intuitive Man

By its critics, the rational choice model is routinely accused of being unrealistic. One key objection has it that, for all nontrivial problems, calculating the best response is cognitively way too taxing, given the severe cognitive limitations of the human mind. If one confines the analysis to consciously controlled decision-making, this criticism is certainly warranted. But it ignores a second mental apparatus. Unlike conscious deliberation, this apparatus does not work serially but in parallel. It handles huge amounts of information in almost no time. It only is not consciously accessible. Only the end result is propelled back to consciousness as an intuition. It is too early to decide whether the rational choice model is ultimately even descriptively correct. But at any rate institutional analysts and institutional designers are well advised to take this powerful mechanisms seriously. In appropriate contexts, institutions should see to it that decision-makers trust their intuitions. This frequently creates a dilemma. For better performance is often not the only goal pursued by institutional intervention. Accountability, predictability and regulability are also desired. Sometimes, clever interventions are able to get them both. Arguably, the obligation to write an explicit set of reasons for a court decision is a case in point. The judge is not obliged to report the mental processes by which she has taken her decision. Justification is only ex post control. Intuitive decision-making is even more desirable if the underlying social problem is excessively complex (NP hard, to be specific), or ill-defined. Sometimes, it is enough for society to give room for intuitive decision-making. For instance, in simple social dilemmas, a combination of cheater detection and punishing sentiments does the trick. However, intuition can be misled. For instance, punishing sentiments are triggered by a hurt sense of fairness. Now in more complex social dilemmas, there are competing fairness norms, and people intuitively choose with a self-serving bias. In such contexts, institutions must step in so that clashing intuitions do not lead to social unrest.intuition, consciousness, rational choice, heuristics, ill-defined social problems, institutions

Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups

Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown to outperform classic alpha-beta search in games where good heuristic evaluations are difficult to obtain. In recent years, combining ideas from traditional minimax search in MCTS has been shown to be advantageous in some domains, such as Lines of Action, Amazons, and Breakthrough. In this paper, we propose a new way to use heuristic evaluations to guide the MCTS search by storing the two sources of information, estimated win rates and heuristic evaluations, separately. Rather than using the heuristic evaluations to replace the playouts, our technique backs them up implicitly during the MCTS simulations. These minimax values are then used to guide future simulations. We show that using implicit minimax backups leads to stronger play performance in Kalah, Breakthrough, and Lines of Action.Comment: 24 pages, 7 figures, 9 tables, expanded version of paper presented at IEEE Conference on Computational Intelligence and Games (CIG) 2014 conferenc

Lex-Partitioning: A New Option for BDD Search

For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their characteristic functions. BDD partitioning is used to compute the image as the disjunction of smaller subimages. In this paper, we propose a novel BDD partitioning option. The partitioning is lexicographical in the binary representation of the states contained in the set that is represented by a BDD and uniform with respect to the number of states represented. The motivation of controlling the state set sizes in the partitioning is to eventually bridge the gap between explicit and symbolic search. Let n be the size of the binary state vector. We propose an O(n) ranking and unranking scheme that supports negated edges and operates on top of precomputed satcount values. For the uniform split of a BDD, we then use unranking to provide paths along which we partition the BDDs. In a shared BDD representation the efforts are O(n). The algorithms are fully integrated in the CUDD library and evaluated in strongly solving general game playing benchmarks.Comment: In Proceedings GRAPHITE 2012, arXiv:1210.611

Gaming Business Communities: Developing online learning organisations to foster communities, develop leadership, and grow interpersonal education

This paper explores, through observation and testing, what possibilities from gaming can be extended into other realms of human interaction to help bring people together, extend education, and grow business. It uses through action learning within the safety of the virtual world within Massively Multiplayer Online Games. Further, I explore how the world of online gaming provides opportunity to train a wide range of skills through extending Revans’ (1980) learning equation and action inquiry methodology. This equation and methodology are deployed in relation to a gaming community to see if the theories could produce strong relationships within organisations and examine what learning, if any, is achievable. I also investigate the potential for changes in business (e.g., employee and customer relationships) through involvement in the gaming community as a unique place to implement action learning. The thesis also asks the following questions on a range of extended possibilities in the world of online gaming: What if the world opened up to a social environment where people could discuss their successes and failures? What if people could take a real world issue and re‐create it in the safe virtual world to test ways of dealing with it? What education answers can the world of online gaming provide

Dagstuhl Reports : Volume 1, Issue 2, February 2011

Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn