scholarly journals The special issue: agent-based computational economics—overview

2012 ◽  
Vol 27 (2) ◽  
pp. 115-122 ◽  
Author(s):  
Robert E. Marks ◽  
Nicolaas J. Vriend

AbstractThe Knowledge Engineering Review is an outstanding journal in Computer Science. The guest editors and contributors to this Special Issue are economists. Why is this so? In recent years, there has been a growing dialogue between economists and computer scientists, to our mutual benefit. The Special Issue is devoted to nine papers in which economists survey aspects of the field of agent-based computational economics models, and in some cases report on new findings in several areas of application. As such, we hope it has something to offer both computer scientists and economists.

Author(s):  
Keiki Takadama ◽  
Kiyoshi Izumi

Agent-Based Simulation (ABS), an interdisciplinary area embracing both the computer science and the social science, has attracted much attention and aided the understanding of socially complex phenomena. A current important issue in this research area is how to improve ABS effectiveness and comprehension, which makes further mutual influence between the computer science and the social sciences indispensable - e.g., (1) agent modeling involving learning mechanisms in the computer science and (2) social dynamics analysis needed in the social science. Such integration of these two areas would help fulfill the great potential of ABS, first in solving complex engineering problems using agent-based technology and second in developing and testing new theories on socially complex systems. This special issue features ABS papers from both of these important areas exploring new trends in ABS. The 10 papers composing this special issue start with papers by Nobutada Fujii and Hiroyasu Inoue analyzing the relationship between the network structure and system dynamics. In these papers, an agent-based computational economics approach has been active in applying agent-based technologies to financial and economic systems. Papers by Biliana Alexandrova-Kabadjova, Isamu Okada, TomokoOhi, and Nariaki Nishino cover consumer and financial markets using agent-based models. They test economic theory and examine market phenomena for market design. Agent-based simulation is increasingly used in application fields in the social sciences. Papers by Kiyoshi Izumi, Hideki Fujii, Hiromitsu Hattori, and Shigeo Sagai propose solutions for actual social problems such as injury prevention, traffic, and electrical power. Models are created based on behavior data, and the integration of an agent-based model and real data is a hot topic in this area. As the beginning of these technical papers, this issue starts by a position paper to give an ABS overview for understanding important issues in ABS from an overall viewpoint and for understanding state-of-the-art ABS. The information presented is invaluable in helping readers grasp the important features of ABS.


2007 ◽  
Vol 17 (2) ◽  
pp. 173-175
Author(s):  
THIERRY PAUL

This special issue of Mathematical Structures in Computer Science contains several contributions to the Workshop3 corps, classique-quantique, discret-continu.The Workshop was held at the Ecole Normale Supérieure, Paris on 28–29 September 2004 in the framework of the Collectif Histoire Philosophie Sciences. The Workshop was organised by Giuseppe Longo and Thierry Paul with the aim of bringing together mathematicians, physicists, computer scientists and philosophers.


2013 ◽  
Vol 13 (4-5) ◽  
pp. 465-470 ◽  
Author(s):  
EVELINA LAMMA ◽  
TERRANCE SWIFT

The proceedings of the International Conference on Logic Programming (ICLP) have had several publishers, including MIT Press and Springer's Lecture Notes in Computer Science. Beginning in 2010, the proceedings have been published in a dual format: with regular papers contained in a special issue of Theory and Practice of Logic Programming (TPLP), and technical communications as a Dagstuhl LIPics series publication. The reason for the change was that compared to researchers in other fields, computer scientists publish more in conferences or symposia and less in journals. The thinking went that since many ICLP papers are of journal quality – or nearly so – why not publish them in a journal straight away? And why not TPLP?


2021 ◽  
pp. 030631272110109
Author(s):  
Ole Pütz

The formulation of computer algorithms requires the elimination of vagueness. This elimination of vagueness requires exactness in programming, and this exactness can be traced to meeting talk, where it intersects with the indexicality of expressions. This article is concerned with sequences in which a team of computer scientists discuss the functionality of prototypes that are already implemented or possibly to be implemented. The analysis focuses on self-repair because this is a practice where participants can be seen to orient to meanings of different expressions as alternatives. By using self-repair, the computer scientists show a concern with exact descriptions when they talk about existing functionality of their prototypes but not when they talk about potential future functionality. Instead, when participants talk about potential future functionality and attend to meanings during self-repair, they use vague expressions to indicate possibilities. Furthermore, when the computer scientists talk to external stakeholders, they indicate through hedges whenever their descriptions approximate already implemented technical functionality but do not describe it exactly. The article considers whether the code of working prototypes can be said to fix meanings of expressions and how we may account for human agency and non-human resistances during development.


2021 ◽  
Vol 35 (2) ◽  
Author(s):  
Matteo Baldoni ◽  
Federico Bergenti ◽  
Amal El Fallah Seghrouchni ◽  
Michael Winikoff

2011 ◽  
Vol 21 (4) ◽  
pp. 671-677 ◽  
Author(s):  
GÉRARD HUET

This special issue of Mathematical Structures in Computer Science is devoted to the theme of ‘Interactive theorem proving and the formalisation of mathematics’.The formalisation of mathematics started at the turn of the 20th century when mathematical logic emerged from the work of Frege and his contemporaries with the invention of the formal notation for mathematical statements called predicate calculus. This notation allowed the formulation of abstract general statements over possibly infinite domains in a uniform way, and thus went well beyond propositional calculus, which goes back to Aristotle and only allowed tautologies over unquantified statements.


2018 ◽  
Vol 27 (4) ◽  
pp. 441-441
Author(s):  
PAUL BALISTER ◽  
BÉLA BOLLOBÁS ◽  
IMRE LEADER ◽  
ROB MORRIS ◽  
OLIVER RIORDAN

This special issue is devoted to papers from the meeting on Combinatorics and Probability, held at the Mathematisches Forschungsinstitut in Oberwolfach from the 17th to the 23rd April 2016. The lectures at this meeting focused on the common themes of Combinatorics and Discrete Probability, with many of the problems studied originating in Theoretical Computer Science. The lectures, many of which were given by young participants, stimulated fruitful discussions. The fact that the participants work in different and yet related topics, and the open problems session held during the meeting, encouraged interesting discussions and collaborations.


Sign in / Sign up

Export Citation Format

Share Document