Sverker Janson's publications and reports
Parallel computingEmbla - Data Dependence Profiling for Parallel Programming. Karl-Filip Faxén, Konstantin Popov, Sverker Janson, Lars Albertsson. In Proceedings of the 2008 International Workshop on Multi-Core Computing Systems (MuCoCoS'08), 2008.
Utility computingLibra, a Multi-hop Radio Network Bandwidth Market. Lars Rasmusson and Sverker Janson. In ADHOC'07 - 7th Scandinavian Workshop on Wireless Ad-hoc Networks, 2007.
Self-managing systemsTowards Self-Managing Systems. Joakim Eriksson, Niclas Finne, and Sverker Janson. ERCIM News No. 58, July 2004. [ PDF | HTML ]
Trading agentsAgent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms. Han La Poutre, Norman Sadeh, and Sverker Janson (editors). Lecture Notes in Artificial Intelligence, Vol. 3937. Springer-Verlag, 2006. [ URL]
This book constitutes the thoroughly refereed post-proceedings of the 7th International Workshop on Agent-Mediated Electronic Commerce, AMEC VII 2005, held in Utrecht, Netherlands in July 2005, as part of AAMAS 2005, and the third Workshop on Trading Agent Design and Analysis, TADA 2005, held in Edinburgh, UK in August 2005, in the course of the IJCAI 2005 conference meetings.
Evolution of a Supply Chain Management Game for the Trading Agent Competition. Joakim Eriksson, Niclas Finne, and Sverker Janson. AI Communications 19(2006):1-12, 2006. [ PDF]
TAC SCM is a supply chain management game for the Trading Agent Competition (TAC). The purpose of TAC is to spur high quality research into realistic trading agent problems. We discuss TAC and TAC SCM: game and competition design, scientific impact, and lessons learnt.
The Supply Chain Management Game for the 2005 Trading Agent Competition. John Collins, Raghu Arunachalam, Norman Sadeh, Joakim Eriksson, Niclas Finne, and Sverker Janson. Carnegie Mellon University, Technical Report CMU-ISRI-04-139, December 2004. [ PDF ]
The Supply Chain Management Game for the 2005 Trading Agent Competition held during IJCAI 2005, in Edinburgh, Scotland. The supplier model has been substantially revised to overcome the "Day Zero" strategic singularity in TAC SCM 2003 and 2004.
The Supply Chain Management Game for the Trading Agent Competition 2004. Raghu Arunachalam, Joakim Eriksson, Niclas Finne, Sverker Janson, and Norman Sadeh. SICS Technical Report T2004-09, May 2004. [ PDF ]
This report is the specification for the Trading Agent Competition Supply Chain Management Game - TAC SCM-04, to be held between July 20-22, 2004, in New York in conjunction with AAMAS-04. Based on the experience of the 2003 Trading Agent Competition a few enhancements have been added to the original game: (1)The price function has been modified to better reflect demand; (2) storage costs have been introduced; and (3) customer demand has been segmented into multiple markets.
The Trading Agent Competition Supply Chain Management Game. Raghu Arunachalam, Joakim Eriksson, Niclas Finne, Sverker Janson, and Norman Sadeh. Carnegie Mellon University, Technical Report CMU-ISRI-03-106, August 2003. [ PDF ]
The Supply Chain Management Game for the 2003 Trading Agent Competition held during IJCAI 2003, in Acapulco, Mexico.
A supply chain management game for the Trading Agent Competition. Raghu Arunachalam, Norman Sadeh, Joakim Eriksson, Niclas Finne, and Sverker Janson. IJCAI-03 Workshop on Trading Agent Design and Analysis, Acapulco, August 2003. [ PDF ]
In this paper we discuss the motivation behind the design of the supply chain management trading agent competition game(TAC SCM). We look at some of the new challenges introduced by the game and summarize what we view as key research challenges that need to be addressed in designing successful game agents.
The Trading Agent Competition (TAC) has now become an annual fixture since its inception in 2000. For the fourth edition of this competition, TAC-03, to be held in August 2003, the authors have created a novel supply-chain trading game with the aim of investigating automated agents in the context of dynamic supply-chain management.
The finals of the third annual Trading Agent Competition were held on 28 July 2002, co-located with AAAI-02 in Edmonton, Canada. The actual games took place on the Internet, with the game and auction servers running at SICS in Kista, Sweden. The agents resided at the home locations of the participating research groups.
A constraint programming agent for automated trading. Erik Aurell, Magnus Boman, Mats Carlsson, Joakim Eriksson, Niclas Finne, Sverker Janson, Per Kreuger, and Lars Rassmusson. In 8th International Conference of The Society for Computational Economics Computing in Economics and Finance, Aix-en-Provence, France, June 27-29, 2002. [ PDF | CiteSeer ]
The Trading Agent Competition (TAC) combines a fairly realistic model of the Internet commerce of the future, including shopbots and pricebots, with a challenging problem in automated reasoning and decision making. SICS TAC'01 entry "006", encapsulating a constraint programming solution, is explained in some detail.
Agent-based marketsAgents, self-interest and electronic markets. Lars Rasmusson and Sverker Janson. Knowledge Engineering Review, Vol. 13:2, 1999, 1-8. [ PDF | CiteSeer ]
How free are our software agents to take the best possible care of our interests? How free can we make them? We address these issues in the context of electronic markets, such as consumer goods markets and (future, more fine-grained) markets for electric power or communication bandwidth.
SICS MarketSpace: an agent-based market infrastructure. Joakim Eriksson, Niclas Finne, and Sverker Janson. In First International Workshop on Agent-Mediated Electronic Trading, AMET-98, Selected Papers, Lecture Notes in Computer Science 1571, Springer-Verlag, 1999. [ PDF | CiteSeer ]
We present a simple and uniform communication framework for an agent-based market infrastructure, the goal of which is to enable automation of markets with self-interested participants distributed over the Internet.
SICS AgentBase - a toolbox for developing MarketSpace agents. Joakim Eriksson, Niclas Finne, and Sverker Janson. In AAAI-98 Workshop on Software Tools for Developing Agents, Madison, Wisconsin, July 1998. [ PDF ]
To each and everyone an agent: augmenting web-based commerce with agents. Joakim Eriksson, Niclas Finne, and Sverker Janson. In Proceedings of the International Workshop on Intelligent Agents on the Internet and Web, World Congress on Expert Systems, Mexico City, March 1998. [ PDF | CiteSeer ]
We present an integration of an agent-based infrastructure, SICS MarketSpace, with the web. Personal assistant agents help users in their interaction with services and are able to handle routine tasks off-line. Agent-enabled services are able to adapt to the interests of their users, even on their first visit. ...
An Internet software platform based on SICStus Prolog. Joakim Eriksson, Fredrik Espinoza, Niclas Finne, Fredrik Holmgren, Sverker Janson, Niklas Kaltea, and Olle Olsson. Workshop on Logic Programming and the Web, WWW5, San Jose, 1997. [ PDF | CiteSeer ]
MarketSpace'96 - An Open Agent-Based Market Infrastructure. Joakim Eriksson, Niclas Finne, Sverker Janson (Editors). UPMAIL Technical Report No. 147, Computing Science Department, Uppsala University, April 1997. [ PDF | CiteSeer ]
We describe the results of the MarketSpace project, carried out as part of the Software Systems (Programvarusystem DV1, 20p) course, in the fourth year of the programming methodology branch of the Computer Science Program (DVP) at Uppsala University.
Information and interaction in MarketSpace - towards an open agent-based market infrastructure. Joakim Eriksson, Niclas Finne, and Sverker Janson. In Second USENIX Workshop on Electronic Commerce, USENIX, Nov 1996. [ PDF | CiteSeer ]
The lack of structure of information and interaction in current web-based electronic commerce makes partial or full automation infeasible. We describe the first steps towards an open agent-based market infrastructure, with well-defined information and interaction models allowing agents to locate relevant market participants, exchange interests, and negotiate deals.
Information and interaction in MarketSpace and their implementation in Prolog. Joakim Eriksson, Niclas Finne, and Sverker Janson. 1st Workshop on Logic Programming Tools for Internet Applications, ICLP'96, Sept 1996. [ PDF | CiteSeer ]
Soft securityUsing agents to secure the Internet marketplace - Reactive Security and Social Control. Lars Rasmusson, Andreas Rasmusson, and Sverker Janson. In Proceedings of Practical Applications of Agents and Multi-Agent Systems 1997 (PAAM'97), London, UK, Apr 1997.
Reactive security and social control are after-the-fact approaches to security. A reactive security component complements social control mechanisms when it is used to feed back information about the outcomes of interactions between users and agents.
The paper contains a discussion on the security approach taken in most of todays agent systems and how security is enforced by Intrusion Detection Systems. We give a rationale for using an interactive Personal Security Assistant as an aid for detecting malicious agents visiting end-user agent environments and sketch the architecture and design criteria of such an assistant.
We describe our work in progress of constructing a workbench to run simulations of electronic markets. By examining the success of different security mechanisms to avoid maliciously behaving actors we hope to gain insight into how to create electronic markets.
Agent-based personal communicationPersonalized Decentralized Communication. Tomas Olsson, Andreas Rasmusson, and Sverker Janson. In Bringing Knowledge to Business Processes Papers from 1999 AAAI Spring Symposium, Steffen Staab and Dan O'Leary, Cochairs, Technical Report SS-00-03, AAAI Press. [ PDF | CiteSeer ]
Search engines, portals and topic-centered web sites are all attempts to create more or less personalized web-services. However, no single service can in general fulfill all needs of a particular user, so users have to search and maintain personal profiles at several locations. We propose an architecture where each person has his own information management environment where all personalization is made locally.
Intentions and intelligent screening in an agent-based personal communication system. Johan Montelius, Sverker Janson, Jan Gabrielsson, et al. Workshop on Intelligent Agents in Telecommunication Applications, ECAI'96, Budapest, Aug 1996. [ PDF | CiteSeer ]
We propose an agent-based scheme for intelligent screening that allows the caller to present both identity and intentions. The scheme uses a metaphor of business cards to make the calling and screening procedures easy to understand.
Concurrent constraint programmingThe implementation of AKL(FD). Björn Carlson, Mats Carlsson, and Sverker Janson. In Logic Programming: Proceedings of the 1995 International Symposium, The MIT Press, 1995. [ PDF | CiteSeer ]
AKL(FD) is an integration of (an extension of) the finite domain constraint system FD in AKL, a deep concurrent constraint programming language. In this paper we describe the implementation of the FD solver and its adaptation to the generic constraint interface of the AGENTS implementation of AKL.
An introduction to AKL - A multiparadigm programming language. Sverker Janson and Seif Haridi. In Constraint Programming, NATO-ASI Series vol. 131, Springer-Verlag, 1994. [ PDF ]
AKL is a multi-paradigm programming language based on a concurrent constraint framework, directly or indirectly supporting the following paradigms.
AKL(FD) - A concurrent language for FD programming. Björn Carlson, Seif Haridi, and Sverker Janson. In Logic Programming: Proceedings of the 1994 International Symposium, The MIT Press, 1994. [ PDF | CiteSeer ]
We consider a complete implementation of an extension of the finite domain constraint system FD, including antimonotone constraints, and its integration in AKL, a deep-guard concurrent constraint language.
Implementation of Andorra-based languages. Sverker Janson. In Logic Programming: Proceedings of the Eleventh International Conference of Logic Programming, pp. 9-10, The MIT Press, 1994. [ Tutorial Slides ]
This advanced tutorial reviews implementation issues for logic and constraint programming languages based on the Andorra model, with a particular emphasis on deep guard concurrent constraint programming languages.
AKL - A Multiparadigm Programming Language. Sverker Janson. Uppsala Theses in Computing Science 19, Uppsala University, SICS Dissertation Series 14, Swedish Institute of Computer Science, June 1994. (212pp) [ PDF | CiteSeer ]
This thesis reports on an investigation into principles for combining the constraint solving and don't know nondeterministic capabilities of Prolog and the constraint logic programming languages with the process-describing capabilities of concurrent logic languages such as GHC. The result, AKL, is a coherent language supporting multiple programming paradigms, such as concurrent, object-oriented, functional, logic, and constraint programming. In addition, AKL offers a large potential for automatic parallel execution.
Ports for objects in concurrent logic programs. Sverker Janson, Johan Montelius, and Seif Haridi. In Agha, Wegner, and Yonezawa (eds.), Research Directions in Concurrent Object-Oriented Programming, The MIT Press, 1993. [ PDF | CiteSeer ]
We introduce ports, an alternative to streams, as communication support for object-oriented programming in concurrent constraint logic programming languages. Ports provide efficient many-to-one communication, object identity, means for garbage collection of objects, and opportunities for optimised compilation techniques for concurrent objects.
The Andorra Kernel Language (AKL): A general purpose concurrent constraint language. Seif Haridi, Sverker Janson, Johan Montelius, Torkel Franzen, Per Brand, Kent Boortz, and Björn Danielsson. First Workshop on Principles and Practices of Constraint Programming PPCP'93, April 1993. [ PDF | CiteSeer ]
We revisit the description of AKL by Janson and Haridi, adding the formal machinery which is necessary in order to completely formalize the control of the computation model. To this we add a formal description of the transformational semantics of AKL. The semantics is a set of or-trees which also captures infinite computations.
Programming paradigms of the Andorra Kernel Language. Sverker Janson and Seif Haridi. In Saraswat and Ueda (eds.), Logic Programming: Proceedings of the 1991 International Symposium, The MIT Press, 1991. [ PDF | CiteSeer ] Also available as SICS Research Report R91:08. [ PDF ]
The Andorra Kernel Language (AKL) is introduced. We show how AKL provides the programming paradigms of both Prolog and GHC. This is the original goal of the design. It has also been possible to provide capabilities beyond that of Prolog and GHC. There are means to structure search, more powerful than plain backtracking. It is possible to encapsulate search in concurrent reactive processes...
Kernel Andorra Prolog and its computation model. Seif Haridi and Sverker Janson. In Warren and Szeredi (eds.), Logic Programming: Proceedings of the Seventh International Conference, The MIT Press, 1990. [ PDF | CiteSeer ] Also available as SICS Research Report 90002. [ PDF ]
The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints.
Epistemic reasoningEpistemic reasoning, logic programming, and the interpretation of questions. Manny Rayner and Sverker Janson. In Dahl and Saint-Dizier (eds.), Natural Language Understanding and Logic Programming II, North-Holland, 1988.
Finding out = achieving decidability. Manny Rayner and Sverker Janson. In Davis, E., Morgenstern, L., and Sanders, K., editors, IJCAI Workshop on Knowledge, Perception and Planning, 1989. Also available as SICS Research Report R89016. [ PDF | CiteSeer ]
We present a framework for reasoning about the concepts of "knowing what" and "finding out", in which the key concept is to identify "finding out the answer to question Q" with "achieving a situation in which Q is decidable".
Popular science in SwedishSmartare e-handel med intelligenta agenter. Sverker Janson. Forskning och Framsteg 7/00, pp. 44-48. [ HTML ]
Överflödet av information på Internet och nya avreglerade marknader skapar behov av nya verktyg. En populär ansats bygger på s k intelligenta agenter.
Vad är agenter? Varför behöver vi agenter? Vilka är deras roller?. Sverker Janson. Rättsliga och andra aspekter på agentteknik, PM 7:2000, Det IT-Rättsliga Observatoriet, 2000. [ PDF ]
En introduktion till agenter som utgångspunkt för en seminariediskussionen om rättsliga aspekter av agentteknik. Syftet är att klargöra vad man menar med "agent" i IT-sammanhang, varför detta agentbegrepp behövs, och var, och i vilka situationer och roller, agenter kan fylla en funktion.
Talk to my agent. Sverker Janson. Corporate Computing 1997. [ HTML ]
Tror man att AI fortfarande är ute är man tyvärr felunderrättad. Trenden vände i USA när man i Desert Storm sparade enorma belopp tack vare AI-baserade planeringsverktyg, enligt vissa bedömare lika mycket som ARPA dittills satsat på AI-forskning. Idag ser vi ett starkt växande intresse för AI-kompetens och verktyg...
Internet om 20 år - att vänta det oväntade. Sverker Janson. PC World 1997. [ HTML ]
Framtiden har en förmåga att ständigt erbjuda det oväntade (och tur är väl det). Vi väntar oss väl alla att Internet om 20 år kommer att förena alla punkter i den kända världen, fasta och rörliga, med ett svindlande flöde av information, att det kommer att vara världens och all verksamhets pulsåder. Men vad kommer att förvåna oss, eller åtminstone de flesta av oss?