• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2196-2207
• /
• 2017

This paper presents a two-stage market auction model in a pool-based electricity market, which explicitly takes into account the system network security. The security network-constrained market auction model considers the use of corrective control to yield economically efficient actions in the post-contingency state, while ensuring a certain security level. Under this framework, the proposed model shows not only for quantifying the correlation between secure system operation and efficient market operation, but also for providing transparent information on the pricing system security for market participants. The two-stage market auction procedure is formulated using Benders decomposition (BD). In the first stage, the market participants bid in the market for maximizing their profit, and the independent system operator (ISO) clears the market based on social welfare maximization. System network constraints incorporating post-contingency control actions are described in the second stage of the market auction procedure. The market solutions, along with the BD, yield nodal spot prices (NSPs) and nodal congestion prices (NCPs) as byproducts of the proposed two-stage market auction model. Two benchmark systems are used to test and demonstrate the effectiveness of the proposed model.

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

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1719-1725
• /
• 2000

Since the advance of WWW, internet related fields have been growing very rapidly. Especially, the development of electronic commerce ares have changed even or life style. This paper is about the design and implementation of an internet auction system, which is considered as on of the most attractive internet services. An internet auction system has more complex processes compared with other electronic commerce systems. In auction systems, bids and a successful bid are required in trading all goods. In this paper, I designed and implemented all processes of an internet auction system, in which a bid tracing systems is included for the first time. The bid tracing system is implemented using only HTTP in maintain compatibility in WWW environment. I also used th JAVA blocking concept to simulate two-way communication. The proposed system is implemented on Windows NT environment using JAVA, ASP, and the Oracle database.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.7
• /
• pp.855-861
• /
• 1999

In this paper, we present new application for the auction method which has been based on one-chip microprocessors. We develop the portable wired terminal for market blocker. And, using that, the recommended price of products is able to push into and show the information of action status. Through our research, using EAS(Electronic Auction System), we can prevent supplier from blocker's rigging the market, because anyone who have a qualification for the action blocker is able to participate in action.

• Convergence Security Journal
• /
• v.2 no.1
• /
• pp.69-76
• /
• 2002

Becoming Internet is public, various services using Web are created. Internet auction is not exceptional but make rapid progress. Internet auction system damages user because its security is not perfect and faultless. In this paper, we propose a design of internet auction system providing more secure and convenient environment.

• 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 the Korea Academia-Industrial cooperation Society
• /
• v.8 no.1
• /
• pp.60-64
• /
• 2007

Recently, real time auction system is increasingly required as internet grows up. According to this social requirement change, this paper designed and implemented a real time auction system. The system registers the goods for auction which customers add to their interested list in their point of view, automatically responds their information and gives a chance to the customer to apply to auction immediately via internet, and performs registration such as customer's information, goods, interested goods, etc. And, the customers on the system can purchase their interested goods rapidly and easily by check-up service of their interested and auctioned products without regarding to place or time through a mobile terminal.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.159-170
• /
• 2011

In procurement auctions, auction frequency and transaction volume per auction have been analyzed as important factors in determining auction performance. However, there is no empirical study on the effect of auction frequency and transaction volume in procurement auction. Current studies mainly focus on bidder behavior analysis and new system design in procurement auction. In the study, we analyze the effect of two factors on relative winning price empirically by using real auction data from MRO procurement outsourcing company in Korea. From the results, we find the winning price is lower when the frequency of auction with same item category is lower. The low frequency of auctions means participating bidders have limited information of previous auctions and they bid their best price to win the current auction due to less opportunity of reopening the auction in near future. The larger purchase amounts of MRO items didn’t results in lower winning price, contrary to our hypothesis. The possible reason is that the price of MRO items already reflects the economy of scales and the increased volume per auction do not cause the further discount of MRO items from the auction.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.139-161
• /
• 2006

In this paper, we introduce a new combinatorial auction mechanism - N-Bilateral Optimized Combinatorial Auction (N-BOCA). N-BOCA is a flexible iterative combinatorial auction model that offers optimized trading for multi-suppliers and multi-purchasers in the supply chain. We design the N-BOCA system from the perspectives of architecture, protocol, and trading strategy. Under the given N-BOCA architecture and protocol, auctioneers and bidders have diverse decision strategies f3r winner determination. This needs flexible modeling environments. Hence, we propose an optimization modeling agent for bid and auctioneer selection. The agent has the capability to automatic model formulation for Integer Programming modeling. Finally, we show the viability of N-BOCA through prototype and experiments. The results say both higher allocation efficiency and effectiveness compared with 1-to-N general combinatorial auction mechanisms.

• Advances in robotics research
• /
• v.2 no.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.