• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.963-970
• /
• 2002

In this paper, after defining the requirements to improve the processing of Internet auction, we design and implement Internet Auction Agent System (IAAS) based on the requirements. IAAS consists of a multi - agent system with buying/selling/negotiation agents for auction processing in accordance with the given price strategy, a graphic interface for supporting price strategies, an information agent for supplying real time information and remote control of agents, and DB. For the mobility, scalability, functionality and communication efficiency of agents, IAAS is implemented by using Java JDK1.3, Servlet, RMI and socket. Through the comparative analysis, we show that IAAS fulfills the requirements defined. IAAS can improve the convenience of users and the efficiency of auction processing, and thus increase the utilization of Internet auction.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.

• ETRI Journal
• /
• v.45 no.5
• /
• pp.735-745
• /
• 2023

This paper surveys recent multiagent reinforcement learning and neural Myerson auction deep learning efforts to improve mobility control and resource management in autonomous ground and aerial vehicles. The multiagent reinforcement learning communication network (CommNet) was introduced to enable multiple agents to perform actions in a distributed manner to achieve shared goals by training all agents' states and actions in a single neural network. Additionally, the Myerson auction method guarantees trustworthiness among multiple agents to optimize rewards in highly dynamic systems. Our findings suggest that the integration of MARL CommNet and Myerson techniques is very much needed for improved efficiency and trustworthiness.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.78-82
• /
• 2001

Most of current Internet auction systems are simple server programs that partly automated the function of the conventional auction house. These system do not provide sufficient independence, distribution and parallelism between the functions of the conventional auction house. In there are automated by server program, but still users need to execute a repetitive task to monitor the dynamic progress of a certain auction, decide proper bid price, and submit the bid. Another problem is that they support only single as English auction and Dutch auction, but they do not support the double auctions are superior to the single auction with respect to speed., efficiency, and the fair distribution of profit. In this paper, we present design and implement of an agent-based continuous double auction system, called CoDABot, in order to mitigate the limitations of current auctions system. CoDABot supports continuous double auction, provides various bidding agent for users to select, and has been implemented into a multi-agent system that realize more independent, distributed, and parallel subsystems.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.73-77
• /
• 2001

In this paper, we propose a virtual action system based on information agents, We call the system the MultiHammer, MultiHammer can be used for studying and analyzing online actions. MuiltiHammer provides functions of implement-ing a meta online action site and an experiment environ-ment. We have been using MultiHammer as an experiment as an experiment environment for BiddinBot. BiddingBot aims at assisting users to bid simultaneously in multiple online auctions. In order to bid simultaneously in multiple online auctions. In order to analyze the behavior of BiddngBot, we need to pur-chase a lot of items. It is hard for us to prepare a lot of fund to show usability and advantage of BiddingBot. MultiHam-mer enables us to effectively analyze the behavior of BiddingBot. MultiHammer consists of three types of agents for information collecting data storing and auctioning. Agents for information wrappers. To make agent work as wrarp-pers, we heed to realize software modules for each online action site. Implementing these modules reguires a lot of time and patience. To address this problem, we designed a support mechanism for developing the modules. Agents for data storing record the data gathered by agents for informa-tion collecting. Agents for auctioning provide online services using data recorded by agents for data storing. By recording the activities in auction sites. MultiHammer can recreate any situation and trace auction for experimentation, Users can participate in virtual using the same information in real online auctions. Users also participate in real auc-tions via wrapper agents for information collecting

• Asia pacific journal of information systems
• /
• v.20 no.3
• /
• pp.33-49
• /
• 2010

We empirically examine the impact of online auction knowledge and category-specific knowledge on the final price of online auctions. Specifically, we question how the relationship between buying and selling experiences affects the final prices of online auctions. Related to the trust between buyers and sellers, we examine the multiple interactions between a buyer-seller pairand aim to identify how these repeated transactions influence the final price. To contrast these effects with other product related factors, we focus on so called 'common value' auctions of vintage stamps on eBay, in which the ex-post value of the product is the same among participating agents’ perceived value. Online auction of stamps provides a representative setting to examine the relationship between market experience and the auction participation behavior in the common value auction, as it provides the book value of stamp as well as price variation across individual buyers with different expertise levels. Our analysis of over 3000 stamps auctions on eBay indicates a significantly high frequency of buyer-seller (pair) interactions, thus suggesting a 'relationship view' of auctions. The work validates five hypotheses derived from the existing theory in economics, marketing, and information systems. Through the common-value auction data, we find that seller's online auction experience and category-specific experience favor sellers by increasing the final price. However, buyer's online auction experience does not affect the final price, but buyer's category-specific experience favors buyers by decreasing the final price. We find that the trust between two trading parties increases the final price.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.197-202
• /
• 2014

In order to operate multiple UAVs for multiple tasks efficiently, we need a task allocation algorithm with minimum cost, i.e.,total moving distance required to accomplish the whole mission. In this paper, we have proposed the MCBAA (Modified Consensus Based Auction Algorithm) which can be suitably applied to the operation of multiple UAVs. The key idea of proposed algorithm is to minimize sum of distance from current location of agents to location of tasks based on the conventional CBAA. Several simulation test performed on three UAV agents with multiple tasks demonstrates the overall efficiency both in time and total distance.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.167-172
• /
• 2002

Recently, some of people are keep in research and development of the further more efficient and convenient auction systems using intelligent software agents in electronic commerce. The purpose of this thesis is that a simple auction system has web bulletin boards, is aided by intelligent agent, and generates pertinent auction duration time and starting price for auction goods of auctioneer into a auction system, then the auctioneer gets the highest margin. The seller who want to sell goods, is using internet sends mail that has information for goods to agent of internet auction system. The agent undertake filtering process for already learned information about similar goods. And it calculate duration time and start price from stored bidding history database. In this thesis we propose a mailing agent system pushing information in internet auction that enables to aid decision for auctioneer about the starting time and price which delivers the highest margin.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.1
• /
• pp.58-71
• /
• 2005

Intelligent agents help automate various tasks, including automated negotiations, on-line auction, and buying/selling products over the Internet. To date, most of the agents are developed only for experiments and some of them are implemented on the limited areas such as an auction. The main objective of this paper is to provide a brief overview of negotiation agents. In doing so, previous studies on negotiation agent systems are revisited and then applications in the real world are reviewed. The limitations on the current negotiation agents are defined and future research directions are suggested.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.532-534
• /
• 2002

최근 인터넷을 이용한 전자상거래는 다양한 방법으로 발전되고 있다. 그 중 인터넷 경매는 인터넷 기술의 발전과 함께 전자상거래의 새로운 비즈니스 모델로 각광받고 있다. 하지만, 대다수 웹 기반의 인터넷경매 시스템은 사용자의 다양만 요구를 만족시키기에 부족하다. 본 논문에서는 이러한 문제점을 해결하기 위하여, 사용자를 대신하여 경매를 수할 수 있는 이동에이전트 기술을 결합한 새로운 인터넷 경매모델을 제시한다. 이를 위하여 Jini 기반 구조하에서 Jini 서비스로 동작하는 이동에이전트 시스템인 JMoblet을 개발하였으며, 개발된 JMoblet 시스템을 이용하여 인터넷 경매를 위한 공통적인 인터페이스(CommonAuction)를 구현하였다.