Finite automata crossing the border into economics

被引:0
作者
Lee, Kyu Sang [1 ]
机构
[1] Minnesota State Univ, Dept Econ, Mankato, MN 56001 USA
来源
WMSCI 2006: 10TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IV, PROCEEDINGS | 2006年
关键词
mechanism design theory; finite automata; Stanley Reiter; economics of information; cybernetics and systems science; George Klir;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The present paper attempts to elucidate the prevalence of the computer metaphor in economics by demonstrating that mechanism design theorists have conceived of organizations as computers. After providing a brief discussion of the intellectual background of the emergence of mechanism design theory. the paper portrays the standard conceptual framework of mechanism design theory. As a concrete illustration of the significance of the computer metaphor in coming into being of the standard conceptual framework under discussion, the paper also offers a discussion of the academic career of a pioneer of mechanism design theory, Stanley Reiter.
引用
收藏
页码:41 / 46
页数:6
相关论文
共 50 条
  • [21] Amount of nonconstructivity in deterministic finite automata
    Freivalds, Rusins
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (38-39) : 3436 - 3443
  • [22] From regular expressions to finite automata
    Champarnaud, JM
    Ponty, JL
    Ziadi, D
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 72 (04) : 415 - 431
  • [23] Transition Function Complexity of Finite Automata
    Valdats, Maris
    BALTIC JOURNAL OF MODERN COMPUTING, 2019, 7 (03): : 342 - 353
  • [24] A necessary condition on invertibility of finite automata
    Renji Tao
    Shihua Chen
    Science in China Series E: Technological Sciences, 1997, 40 : 637 - 643
  • [25] Abstracting an Operational Semantics to Finite Automata
    Baklanova, Nadezhda
    Ricciotti, Wilmer
    Smaus, Jan-Georg
    Strecker, Martin
    INFORMATION AND COMMUNICATION TECHNOLOGIES IN EDUCATION, RESEARCH, AND INDUSTRIAL APPLICATIONS, 2016, 594 : 109 - 123
  • [26] Minimizing finite automata is computationally hard
    Malcher, A
    THEORETICAL COMPUTER SCIENCE, 2004, 327 (03) : 375 - 390
  • [27] Operations on Boolean and Alternating Finite Automata
    Hospodar, Michal
    Jiraskova, Galina
    Krajnakova, Ivana
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2025,
  • [28] Petri Net Controlled Finite Automata
    Farwer, Berndt
    Jantzen, Matthias
    Kudlek, Manfred
    Roelke, Heiko
    Zetzsche, Georg
    FUNDAMENTA INFORMATICAE, 2008, 85 (1-4) : 111 - 121
  • [29] Finite automata and pattern avoidance in words
    Brändén, A
    Mansour, T
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2005, 110 (01) : 127 - 145
  • [30] Representations of regular ideals in finite automata
    Rystsov, I.K.
    Cybernetics and Systems Analysis, 2003, 39 (05) : 668 - 675