Modeling of Theme Park Problem with Multiagent for Mass User Support

Lecture notes in computer sciencePublished 1 January 2004

Hidenori Kawamura, Koichi Kurumatani, Azuma Ohuchi

DOI10.1007/978-3-540-24666-4_4

Source URL

Citations32

SJR quartileQ2

SJR score0.35

SNIP0.55

TL;DR

The Theme Park Problem is proposed as one example of test bed for mass user support to coordinate many visiting agents’ behavior in a way that increases social welfare without reducing individual satisfaction.

Abstract

We propose the Theme Park Problem as one example of test bed for mass user support. The objective of the problem's solution is to coordinate many visiting agents' behavior in a way that increases social welfare without reducing individual satisfaction. For the computer simulation, we design four types of basic coordination algorithms, and the simulation's results are used to discuss the basic characteristics of the problem.

Keywords

Social SciencesEngineeringBusiness, Management and Accounting

American Mathematical Society eBooksTheory of games and economic behavior

16,943 Citations2019Stephan Ramon Garcia, Steven J. Miller

The MIT Press eBooksGrowing Artificial Societies

2,887 Citations1996Joshua M. Epstein, Robert L. Axtell

Artificial LifeAnt Algorithms for Discrete Optimization

2,819 Citations1999Marco Dorigo, Gianni A. Di +1 more

An overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and the ant colony optimization (ACO) metaheuristic is presented.

Southern Economic JournalGrowing Artificial Societies: Social Science from the Bottom Up

1,092 Citations1998John Duffy, Joshua M. Epstein +1 more

ComputerHot topics-ubiquitous computing

774 Citations1993Mark Weiser

In the long run, the personal computer and the workstation will become practically obsolete because computing access will be everywhere: in the walls, on your wrist, and in 'scrap' computers lying about to be used as needed.

Games and Economic BehaviorAuction Protocols for Decentralized Scheduling

442 Citations2001Michael P. Wellman, William E. Walsh +2 more

This work formalizes decentralized scheduling as a discrete resource allocation problem, and brings to bear some relevant economic concepts about the existence of equilibrium prices for some general classes of scheduling problems, and the quality of equilibrium solutions.

Multiagent coordination in tightly coupled task scheduling

68 Citations1997Jyi-Shane Liu, Katia Sycara

An approach that consists of a standard operating procedure and a look-ahead coordination to prune decision myopia while maintaining system responsiveness in real-time, dynamic environments is presented.

Journal of Intelligent ManufacturingCAMPS: a constraint-based architecturefor multiagent planning and scheduling

42 Citations1998Kazuo Miyashita

A new integrated architecture for distributed planning and scheduling is proposed that exploits constraints for problem decomposition and coordination and together with the constraint-based mechanism of dynamic coalition formation among agents.

IGI Global eBooksSocial Coordination with Architecture for Ubiquitous Agents-CONSORTS

19 Citations2008Koichi Jurumatani

A social coordination mechanism that is realized with CONSORTS, a new kind of multi-agent architecture for ubiquitous agents that are grounded in the physical world, by which software agents can trace users’ moving history, understand their intentions and preferences, and negotiate each other, all while protecting users' privacy through temporal identifiers.

National Conference on Artificial IntelligenceUser Intention Market for Multi-Agent Navigation - An Artificial Intelligent Problem in Engineering and Economic Context

13 Citations2002Koichi Kurumatani

Traditional planning techniques in artificial intelligence is not sufficient even when geometric reasoning is joined to it and some market mechanism has a possibility to work well.