The aim of Information Processing Letters is to allow rapid dissemination of interesting results in the field of information processing in the form of short, concise papers. To this end, submissions should not exceed the equivalent of nine A4 or 81/2–by–11 double–spaced typed pages. The scope of the journal is indicated by the list of keywords found below. This list is periodically updated by inserting items most frequently proposed by the contributors and removing the least popular entries, under the advisement of the Board of Editors. Submissions are encouraged both on theoretical work and on experimental work.

The scope of IPL is suggested by the following alphabetical list of keywords:

Algorithms – analysis of algorithms – approximation algorithms – automatic theorem proving – combinatorial problems – compilers – computational complexity – computational geometry – concurrency – cryptography – databases – data structures – design of algorithms – distributed computing – distributed systems – fault tolerance – formal languages – formal methods – formal semantics – functional programming – graph algorithms – information retrieval – interconnection networks – on-line algorithms – operating systems – parallel algorithms – parallel processing – performance evaluation – program correctness – program derivation – programming calculi – programming languages – program specification – randomized algorithms – real–time systems – safety/security in digital systems – scheduling – software design and implementation – software engineering – specification languages – theory of computation.

Special Issue on Economics and Computation
截稿日期: 2024-04-30

Guest editors:
Dr. Alexandros A. Voudouris, University of Essex
Dr. Argyrios Deligkas, Royal Holloway University of London
Dr. Aris Filos-Ratsikas, University of Edinburgh

Special issue information:
Nowadays, many important problems emerging from real-life applications require tools and techniques from theoretical computer science and economic theory, an area known as EconCS. In some applications there might be agents that act strategically, in which case we are interested in the existence, the computation, and the quality of stable outcomes known as equilibria. In other applications, there are agents with preferences over alternative outcomes, in which case the objective is to compute an outcome that satisfies different axiomatic properties or constraints related to efficiency and fairness. The Special Issue on Economics and Computation at Information Processing Letters will be a collection of original short papers studying problems that fall within EconCS.

Topics of interest include, but are not limited to, the following:

Algorithmic contract theory
Algorithmic mechanism design
Auctions and pricing
Computational social choice and voting
Cooperative game theory
Cost sharing
Efficiency of equilibria and price of anarchy
Equilibria, learning, and dynamics in games
Equilibrium computation and complexity
Fair resource allocation
Network games and graph-theoretic aspects of social networks

Manuscript submission information:
Manuscript submission deadline: 30th April 2024