• 한국정보처리학회논문지
• /
• 제6권11호
• /
• pp.2863-2874
• /
• 1999

Apartment auction is a system that is used for the citizens to get a house. This paper deals with the implementation of a web-based intelligent decision support system using OLAP technique and data mining technique for auction decision support. The implemented decision support system is working on a real auction database and is mainly composed of OLAP Knowledge Extractor based on data warehouse and Auction Data Miner based on data mining methodology. OLAP Knowledge Extractor extracts required knowledge and visualizes it from auction database. The OLAP technique uses fact, dimension, and hierarchies to provide the result of data analysis by menas of roll-up, drill-down, slicing, dicing, and pivoting. Auction Data Miner predicts a successful bid price by means of applying classification to auction database. The Miner is based on the lazy model-based classification algorithm and applies the concepts such as decision fields, dynamic domain information, and field weighted function to this algorithm and applies the concepts such as decision fields, dynamic domain information, and field weighted function to this algorithm to reflect the characteristics of auction database.

• Advances in robotics research
• /
• 제2권3호
• /
• pp.247-257
• /
• 2018

Various studies have been performed to coordinate robots in transporting objects and different artificial intelligence algorithms have been considered in this field. In this paper, we investigate and solve Multi-Robot Transportation problem by using a combined auction algorithm. In this algorithm each robot, as an agent, can perform the auction and allocate tasks. This agent tries to clear the auction by studying different states to increase payoff function. The algorithm presented in this paper has been applied to a multi-robot system where robots are responsible for transporting objects. Using this algorithm, robots are able to improve their actions and decisions. To show the excellence of the proposed algorithm, its performance is compared with three heuristic algorithms by statistical simulation approach.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 The Korea Society for Simulation 98 춘계학술대회 논문집
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• 대한전자공학회논문지TC
• /
• 제46권6호
• /
• pp.11-18
• /
• 2009

본 논문에서는 relay station (RS)이 도입된 이등통신 시스템의 throughput 향상을 위해 base station (BS)와 RS 및 단말간의 link를 hierarchical하게 allocation하는 auction 기반의 알고리듬을 제안한다. Hierarchical link allocation 방식은 인지무선 기능을 가진 각 RS 단위로 일차적으로 해당 서비스 영역 내의 단말들을 대상으로 QoS 만족 여부를 감지하여 RS와 연결될 단말의 set을 정하고, BS 차원에서 해당 단말 set을 대상으로 auction 과정을 진행하여 최종적으로 BS 및 RS와의 link를 지정하는 방식이다. 제안하는 알고리듬에서는 시스템 throughput의 향상을 위해 인접 셀과의 정보 교환을 통해 얻은 co-channel interference (CCI) 정보 및 RS들로부터 수집한 단말 별 QoS의 개선량에 관한 정보를 바탕으로 auction 과정을 진행하며, auction winner 단말 set에 RS와의 link를 선별적으로 지정한다. 모의실험을 통하여 본 논문에서 제안하는 방식을 적용한 시스템은 셀 내 높은 QoS를 요구하는 사용자의 비율이 높아질수록 기존 알고리듬에 비해 단말의 QoS를 보다 효과적으로 만족 시킬 수 있음을 보였다. 또한 셀의 traffic load가 높고 인접 셀 CCI의 전력이 강할수록 기존의 알고리듬을 적용한 시스템보다 robust한 throughput 성능을 보였다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2007년도 추계학술대회
• /
• pp.592-601
• /
• 2007

In the conventional double auction approaches, two basic assumptions are usually applied - (1) each trader has a linear or quasi-linear utility function of price and quantity, (2) buyers as well as sellers have identical utility functions. However, in practice, these assumptions are unrealisitc. Therefore, a flexible and integrated double auction mechanism that can integrate all traders' diverse utility functions is necessary. We propose a double auction mechanism with resource allocation based on nonlinear utility functions, namely a flexible synchronous double auction system where each participant can express a diverse utility function on the price and quantity. In order to optimize the total market utility consists of multiple complex utility functions of traders, our study proposes a genetic algorithm (GA) We show the viability of the proposed mechanism through several simulation experiments.

• Journal of Electrical Engineering and Technology
• /
• 제1권1호
• /
• pp.1-7
• /
• 2006

In an electricity market, the spot market is normally integrated with a forward or future market. The advantage of the forward market is to allow the market participants to deal in a part or the whole trading portfolio at a fix price in advance and to avoid risk associated to the uncertain price of the spot market. Japan has introduced a continuous auction base forward market from April 2005. This paper analyzes the Japanese forward market rules and operations, and introduces a new algorithm that may improve the efficiency of the market itself. The proposed algorithm enables us to give consideration to the specific characteristics of the power system and to integrate them in the auction mechanism. The benefits of the proposed algorithm are verified on an electronic simulation platform and the results described in this paper.

• 한국시뮬레이션학회논문지
• /
• 제23권4호
• /
• pp.197-202
• /
• 2014

다수의 임무를 다중의 무인기로 효과적으로 수행하기 위해서는 전체 임무를 수행하는데 필요한 총 이동거리를 최소화로 하는 알고리즘이 필요하다. 본 논문에서는 다수의 무인기 운용에 적합하게 적용할 수 있는 수정된 합의 기반 경매 알고리즘(Modified Consensus Based Auction Algorithm)을 제안한다. 제안하는 알고리즘의 핵심 아이디어는 기존의 합의 기반 경매 알고리즘을 기초로 하여 에이전트들의 위치와 임무까지의 거리의 합을 최소화하는 것이다. 3개의 UAV 에이전트로 다수의 임무를 수행하는 시뮬레이션을 진행하였고 전체 임무 완수 시간과 전체 이동 거리 측면에서 효율적임을 보였다.

• 한국경영과학회지
• /
• 제33권1호
• /
• pp.19-33
• /
• 2008

In the previous double auction research for the market optimization, two basic assumptions are usually applied - (1) each trader has a linear or quasi-linear utility function of price and quantity, and (2) buyers as well as sellers have identical utility functions. However, in practice, each buyer and seller in a double auction market may have diverse utility functions for trading goods. Therefore, a flexible and integrated double auction mechanism that can integrate all traders' diverse utility functions is necessary. In particular, the flexible mechanism is more useful in a synchronous double auction because traders can properly change utilities in each round. Therefore, in this paper, we propose a flexible synchronous double auction mechanism in which traders can express diverse utility functions for the price and quantity of the goods, and optimal total market utility is guaranteed. In order to optimize the total market utility which consists of multiple complex utility functions of traders. We show the viability of the proposed mechanism through a several simulation experiments.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.337-340
• /
• 1999

At each iteration, the path is either extended by adding a new node, or contracted by deleting its terminal node. When the destination becomes the terminal node of the path, the algorithm terminate. In the process of finding the shortest path to given destination, the algorithm visits other node, there by obtaining a shortest path from the origin to them. We show here that when the auction algorithm is applied to this equivalent program with some special rules for choosing the initial object prices and the person submitting a bid at each iteration, one obtains the generic form of the $\varepsilon$-relaxation method. Thus, the two methods are mathematically equivalent

• 한국통신학회논문지
• /
• 제38A권11호
• /
• pp.944-954
• /
• 2013

인지무선(cognitive radio)기술은 특정 주파수에 대해 권한을 가진 주 사용자가 자신의 주파수를 사용하지 않을 때 생기는 유휴 대역을 특정 주파수에 대해 권한이 없는 부 사용자가 사용할 수 있도록 하는 기술이다. 본 논문에서는 인지무선 네트워크에 옥션 게임 이론을 적용시켜, 주파수 가격과 옥션 주기를 동시에 고려한 주 사용자의 이득을 최대화 할 수 있도록 하는 알고리즘을 제안한다. 부 사용자들이 제시한 주파수양의 비율에 따라 주 사용자의 주파수를 분배하는 옥션이 반복적으로 진행되면서 주 사용자는 최적의 주파수 가격을 찾게 되며, 찾아진 주파수 가격 정보와 본 논문에서 새로 제시한 주 사용자의 효용함수를 이용해 최적의 옥션 주기를 찾게 된다. 동시에 주 사용자는 찾아진 최적의 옥션 주기에 맞는 주파수 가격을 최종적으로 결정하게 된다.