• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.795-804
• /
• 2006

Most internet auction sites open to users the bid history with the ascending order of bid amounts. Whereas eBay.com presents second bid prices, auction.co.kr provides highest bid prices. In this paper, the bidhistory is arranged according to the passage of tim, which can help to understand the situations and trends of bid prices, especially for multiple auctions. This manipulated data can be visualized by using profile plots. The successful bid prices could be estimated based on some prediction models with appropriate prior informations. Both sellers and bidders can be provided useful informations with these statistical analyses, and then fair online auctions in Korea will grow actively and rapidly.

• 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.

• Journal of Information Technology Services
• /
• v.15 no.3
• /
• pp.247-263
• /
• 2016

The purpose of the study is to derive success factors of B2C reverse auction business model, a business model contributes to the recent innovative practices in e-commerce and service sector. Electronic reverse auction has been traditionally used to ensure the procurement convenience and purchasing efficiency in B2B or B2G settings, however, e-RA is now expanding its basis toward B2C commerce industry along the huge success of an online e-RA travel service provider Priceline.com. Recently, B2C e-RA business model is getting the spotlight in the Korean venture industry with a variety of startups in diverse areas. However, e-RA does not work perfect in all kinds of trade settings. Therefore, we conducted a multiple case study to find out the success factors of B2C business model as follows : First, large supplier basis is an important factor that constructs a quasi-perfect competition environment. Second, the high online and mobile accessibility or e-readiness of Korean consumers was also a critical aspect of the success of e-RA. Lastly, e-RA performs best when the supplier switching cost is low and the trading occurs infrequently.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.527-529
• /
• 2023

Generative Adversarial Networks (GANs) models have developed rapidly due to the emergence of various variation models and their wide applications. Despite many recent developments in GANs, mode collapse, and instability are still unresolved issues. To address these problems, we focused on the fact that a single GANs model itself cannot realize local failure during the training phase without external standards. This paper introduces a novel training process involving multiple GANs, inspired by auction mechanisms. During the training, auxiliary performance metrics for each GANs are determined by the others through the process of various auction methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.42-45
• /
• 2003

본 논문은 무선개인통신(PCS)환경에서 기존의 자원경매다중접속(RAMA)방법이 가지고 있는 단점을 보완할 수 있는 새로운 자원경매다중접속방법(MRAMA)을 제안하기 위한 것이다 제안된 방법은 경매표 개념을 도입하여 슬럿 할당 주기 상에서 경매 슬럿(slot)을 낭비하는 단점을 보완할 수 있으며, 할당 주기마다 갱신되는 경매테이블을 채택하고 선점 및 비선점 우선순위규칙이 혼합된 방법을 활용함으로써 빠르고 유연하게 접속, 핸드오프, 자원할당이 가능해진다. 본 논문에서는 다양한 환경에서의 시뮬레이션을 통해 제안된 MRAMA방법이 기존의 RAMA에 비해 더 향상된 성능을 보이고 있음을 증명한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4197-4219
• /
• 2017

Cloud computing is a new service to provide dynamic, scalable virtual resource services via the Internet. Cloud market is available to multiple cloud computing resource providers and users communicate with each other and participate in market transactions. However, since cloud computing is facing with more and more security issues, how to complete the allocation process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the cloud resource allocation problem and propose a mathematic model based on combinatorial double auction. Secondly, we introduce a trust evaluation mechanism into our model and combine genetic algorithm with simulated annealing algorithm to increase the efficiency and security of cloud service. Finally, by doing the overall simulation, we prove that our model is highly effective in the allocation of cloud resources.

• 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.

• 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

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2002.03a
• /
• pp.39-51
• /
• 2002

Online exchange is a cost-effective approach to trade goods and information among multiple sellers and buyers. Shipping industry includes lots of global entities such as shippers, liners, ship owners and shipping agents. Marine insurance companies and ship repairers and many other groups are also supporting the industry. However, international shipping exchanges are located on few cities in the world. Its our motivation that a shipping market can be online so that market participants do the dealing while sitting where they are with more efficient manner, preferable price and larger pool of candidates of trading partners. This paper presents Korean governmental project of building a cyber shipping exchange. The exchange covers ship sale and purchase, charter, insurance, freight futures, repairs, supplying of ships oil and database service. The workflows of each business were analyzed and designed to fit for online environment. The project includes design of trading mechanism, online documents, data flow, data storage and security. Online match making and trading mechanisms such as auction, reverse auction, bid are used. The whole trading process involves multiple organizations and business processes. So, this Paper focuses on how each organization would play their roles so that users can complete transactions with integrated and transparent view. The online exchange selves also as maritime portal site that links to other sites for cooperation vertically or horizontally, and serves database and information in global perspective. This paper also issues and discusses the justification of an online shipping exchange

• Environmental and Resource Economics Review
• /
• v.28 no.1
• /
• pp.39-59
• /
• 2019

The Korean Demilitarized Zone (DMZ) has the great ecosystem as all the artificial activities in DMZ have been prohibited over half a century. The ecosystem should be conserved even after the reunification of Korea and hence the conservation plan should be established not after the reunification but before it. It requires a considerable budget to conserve DMZ, considering management of ecology resource, recovery, and research. The objective of this paper is to analyze a fund-raising measure for DMZ conservation, using economic incentives mechanism when multiple developers participate in the auction to get the right to develop North Korean regions, have private information about their sunk costs and pay a part of their profits for the fund. First, we analyze the real option model to decide the optimal investment time. Second, we construct the auction for bidders not to misrepresent their private information, based on Bayesian Nash equilibrium.