Intelligent Artificiality: Algorithmic Microfoundations for Strategic Problem Solving

ion layer. Computer scientists routinely use one problem as a model for a different problem, which allows them to export from the solution of one problem to the solution of a different problem [Sedgewick and Wayne, 2014; Knuth, 2011]. One way to export insights from one problem to another is to consider changes of variables that will map problems one into the other – and together onto the canonical problem one has already dealt with. In the case of the Knapsack Problem, re-labeling the network so the nodes become value-added activities in an industry that can be constituted into more or less advantageous value-linked activity networks allows us to frame the problem of the de novo design of platform-based businesses (Uber, AirBnB, Dropbox, Salesforce.com) as problems of finding the optimal set of valuelinked activities that should be integrated within the same organization [Novak and Wernerfeldt, 2002]. In the case of Uber, they include writing off depreciation of personal vehicles and additional disposable income (drivers), predictable scheduling and billing, ease of access and ubiquitous accessibility and secure, auditable, trackable payment (riders), traffic

[1]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[2]  Xiaotie Deng,et al.  Settling the complexity of computing two-player Nash equilibria , 2007, JACM.

[3]  B. Wernerfelt,et al.  On the Grouping of Tasks into Firms: Make‐Or‐Buy with Interdependent Parts , 2012 .

[4]  Pankaj Ghemawat,et al.  Choice Structures , Business Strategy and Performance : A Generalized NK-Simulation Approach by , 2000 .

[5]  Lance Fortnow,et al.  The status of the P versus NP problem , 2009, CACM.

[6]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[7]  Kenneth O. Stanley,et al.  Efficiently evolving programs through the search for novelty , 2010, GECCO '10.

[8]  Martin Reeves,et al.  Your Strategy Needs a Strategy: How to Choose and Execute the Right Approach , 2015 .

[9]  Janardan Misra,et al.  A Randomized Algorithm for 3-SAT , 2009, Math. Comput. Sci..

[10]  Mihnea C. Moldoveanu,et al.  Thinking strategically about thinking strategically: the computational structure and dynamics of managerial problem selection and formulation , 2009 .

[11]  Mark Braverman,et al.  Inapproximability of NP-Complete Variants of Nash Equilibrium , 2011, Theory of Computing.

[12]  Daniel A. Levinthal,et al.  Exploration and Exploitation in Organizational Learning , 2007 .

[13]  Jie Zhang,et al.  An Improved Genetic Algorithm for TSP , 2007 .

[14]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..

[15]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[16]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Wu Li-ying.  How to Teach Computational Thinking in the "Computer Foundation" Course , 2013 .

[19]  Daniel A. Levinthal,et al.  Landscape Design: Designing for Local Action in Complex Worlds , 1999 .

[20]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[21]  Hurvey Leibenstein.  Allocative efficiency vs. X-Efficiency , 1966 .

[22]  Ho Gyun Kim.  On the Evolutionary Theory of the Firm , 2009 .

[23]  Organizations , 1992, Restoration & Management Notes.

[24]  M. Porter,et al.  How CEOs Manage Time , 2018 .

[25]  Daniel A. Levinthal,et al.  Escaping real (non-benign) competency traps: linking the dynamics of organizational structure to the dynamics of search , 2005 .

[26]  M. C. Jensen,et al.  Specific and General Knowledge and Organizational Structure , 1995 .

[27]  Juraj Hromkovic,et al.  Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics , 2001 .

[28]  Moses Charikar,et al.  Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.

[29]  George A. Akerlof.  The Market for “Lemons”: Quality Uncertainty and the Market Mechanism , 1970 .

[30]  Jan W. Rivkin.  Imitation of Complex Strategies , 2000 .

[31]  John H. Holland,et al.  Outline for a Logical Theory of Adaptive Systems , 1962, JACM.

[32]  Lu Hong,et al.  Groups of diverse problem solvers can outperform groups of high-ability problem solvers. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[33]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .