• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.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.

• 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
• /
• 2007.11a
• /
• 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 KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.641-652
• /
• 2001

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

• Horticultural Science & Technology
• /
• v.29 no.6
• /
• pp.641-644
• /
• 2011

A new standard red color gerbera (Gerbera hybrida Hort.) 'Red Auction' was developed from a cross of '01-120-195' and 'Misty red' followed by seedling and line selections at the Flower Research Institute, Gyeongsangnam-do Agricultural Research & Extension Services (ARES) in 2008. Characteristics trials were conducted three times from 2006 to 2008. 'Red Auction' has semi-double type in good harmony with red color (RHS 45-A) ray floret and a good stable flower shape and strong peduncle. Its vase life was 11.3 days. The average yield of 'Red Auction' was 48.8 flowers per plant a year in greenhouse yield trials carried out from 2006 to 2008. This cultivar registered for commercialization in 2010.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.200-209
• /
• 2006

Load building is an important step to make the delivery supply chain efficient. We present a family of load makeup algorithms using market based control strategy, named LoadMarket, in order to build efficient loads where each load consists of a certain number of finished products having destinations. LoadMarket adopts Clark-Wright algorithm for generating initial endowment for Load Traders who cooperate to minimize either total travel distance or the variance with respect to the travel distances of loads by means of the spot market or double-sided auction market mechanism. The efficiency of the LoadMarket algorithms is illustrated using simulation based experiments.

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

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1099-1110
• /
• 2005

As auctions become popular, developing good agent bidding strategies has been an important focus in agent-based electronic commerce research. Especially for the continuous double auctions where no single dominant strategy is known, the agent bidding strategy has practical significance. This paper introduces an adaptive agent strategy for the countinuous double auction. The central idea is to let the agent figure out at run time when the sophisticated strategy (called the p-strategy) is beneficial and when a simpler strategy is better. Balance between exploration and exploitation is achieved by using a heuristic exploration function that trades off the expected profits and the number of tries of each strategy. We have experimentally evaluated the performance of the adaptive strategy in a wide variety of environments. The experiment results indicate that the adaptive strategy outperforms the plain p-strategy when the p-strategy performs poorly, while it performs similar to the p-strategy when the p-strategy dominates the other simple strategies.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.4
• /
• pp.493-504
• /
• 2011

The present paper presents a genetic algorithm (GA) to maximize social welfare and perform congestion management by optimally placing and sizing one Thyristor-Controlled Series Capacitor (TCSC) device in a double-sided auction market. Simulation results, with line flow constraints before and after the compensation, are compared through the Sequential Quadratic Programming SQP method, and are used to analyze the effect of TCSC on the congestion levels of modified IEEE 14-bus and 30-bus test systems. Quadratic, smooth and nonsmooth (with sine components due to valve point loading effect) generator cost curves, and quadratic smooth consumer benefit functions are considered. The main aims of the present study are the inclusion of customer benefit in the social welfare maximization and congestion management objective function, the consideration of nonsmooth generator characteristics, and the optimal locating and sizing of the TCSC using real code-based GA to guarantee fast convergence to the best solution.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.45-50
• /
• 2005

Research and development of grid computing ware mainly focused on high performance computing field such as large-scale computing operation. Many companies and organizations concentrated on existing computational grid. However, service grid focusing on enterprise environments has been noticed gradually. Grid service providers of service grid construct diverse and specialized services and provide service resources that have economic feasibility to grid users. But, service resources are geographically dispersed and divided into many classes and have individual owners and management policies. In order to utilize and allocate resources effectively, service grid needs a resource management model that handles and manages heterogeneous resources of service grid. Therefore, this paper presents the third party grid service marketplace model using virtualization to solve problems of grid service resource management. Also, this paper proposes resource dealing mechanism and pricing algorithms applicable for service grid. Empirical results show usefulness and efficiency of the third party grid service marketplace model in comparison with typical economic models for grid resource management such as single auction model and double auction model.