• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.379-390
• /
• 2005

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 for 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 I-to-N general combinatorial auction mechanisms.

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

• Journal of the Korea Society for Simulation
• /
• v.23 no.1
• /
• pp.1-10
• /
• 2014

A cloud computing is one of a parallel and distributed computing. The cloud computing provides some service for user with virtual resources. However, a user's service request does not show a time pattern. As a result, each resource also shows a different availability at the same time. This difference affects a quality of service (QoS) and a resource selection for users. Therefore, we propose the resource availability-based multi auction model for cloud service reservation and resource brokering system. The proposed system is to select the proper resource provider based on the users' request. The proposal adopts the multi phase of the auction to transact resources. The system evaluates the available factor of each resource on the auction phase, and finally reserves the service on the adaptive queue. The proposed model shows the better performance than other existing method.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.634-637
• /
• 2010

This letter presents a model for a dynamic collaboration (DC) platform among cloud providers (CPs) that prevents adverse business impacts, cloud vendor lock-in and violation of service level agreements with consumers, and also offers collaborative cloud services to consumers. We consider two major challenges. The first challenge is to find an appropriate market model in order to enable the DC platform. The second is to select suitable collaborative partners to provide services. We propose a novel combinatorial auction-based cloud market model that enables a DC platform among CPs. We also propose a new promising multi-objective optimization model to quantitatively evaluate the partners. Simulation experiments were conducted to verify both of the proposed models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5616-5642
• /
• 2016

Different from traditional auctions, electronic auctions provide a platform to allow bidders and auctioneers merchandise to each other over network anytime and anywhere. Auctioneers can publish information of goods, and bidders can choose the interested targets through this bidding platform. To ensure the fairness and security of electronic auctions, Li et al. have proposed a practical electronic auction scheme which can confirm the requirement of strong anonymity, bidding privacy, and secret bidding price. However, we have found out that Li et al.'s scheme may lurk the risk of the denial-of-service attack during the bidding phase in a sealed-bid auction. Thus, we propose a brand-new sealed-bid auction mechanism, in which the essentials of e-auction can be firmly preserved. In particular, each bidder only needs to register at the center once and then can join to multiple plays launched by different auctioneers. Moreover, the correctness of mutual authentication is confirmed according to the BAN logic model.

• Management Science and Financial Engineering
• /
• v.11 no.3
• /
• pp.125-136
• /
• 2005

As the importance of time-based competition is increasing, information systems for supporting the immediate decision making is strongly required. Especially high -tech product firms are under extreme pressure of rapid response to the demand side due to relatively short life cycle of the product. Therefore, the objective of our research is proposing a framework of estimating demand curve based on e-auction data, which is extremely easy to access and well reflect the limited demand curve in that channel. Firstly, we identify the advantages of using e-auction data for full demand curve estimation and then verify it using Agent-Eased-Modeling and Tobin's censored regression model.

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

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2003.05a
• /
• pp.255-263
• /
• 2003

A multi-agent system designed to represent newly deregulated electricity markets in the USA is aimed at testing the capability of the multi-agent model to replicate the observed price behavior in the wholesale market and developing a smart business intelligence which quickly searches the optimum offer strategy responding to the change in market environments. Simulation results show that the optimum offer strategy is to withhold expensive generating units and submit relatively low offers when demand is low, regardless of firm size; the optimum offer strategy during a period of high demand is either to withhold capacity or speculate for a large firm, while it is to be a price taker a small firm: all in all, the offer pattern observed in the market is close to the optimum strategy. From the firm's perspective, the demand-side participation as well as the intense competition dramatically reduces the chance of high excess profit.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.133-148
• /
• 2009

This study has tried to suggest a new model that can effectively redistribute the tickets in the online ticket resale market, while suggesting a new allocation mechanism based on an agent negotiation. To this end, this study has analyzed an auction in the online ticket resale market through Game theory. As a result of new agent mechanism, it has been proved that the price stability of ticket resale market leads to an increase. An agent negotiation helps to stabilize the ticket prices that are usually inclined to rise at auction, benefiting all the participants in the negotiations, consequently showing a Pareto solution. Especially, a framework for a negotiation process is suggested and domain and processes ontology are designed interrelatedly. With this modeling, a possibility of Ontology based agent negotiation is suggested.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.56-82
• /
• 2008

The topic on Flow is generating increased interests in e-commerce studies. Flow has been identified as a key component in e-commerce. Studies on Flow have so far focused on internet shopping mall, but scarcely looked at the Flow of Internet auction. The purpose of study is to find out which factors play a major role in building Flow on internet auction and how the built-up Flow affect Brand Equity. Therefore, the research model investigates what factors influence Flow. Furthermore, the research is designed to understand how the Flow influences Brand Equity. The antecedents of Flow classifies into three types such as personal (Challenge, Skill), IT characteristic, Internet Auction characteristic. The results of this empirical study shows that three characteristics significantly affected the flow：personal (Challenge), IT (information quality, system quality), and Internet Auction (interactivity). And also Flow has significant effect on the brand equity. This result indicates that customer's optimal experience is important to increase brand equity. That is, the flow is influenced by multi-dimensional factors and plays an important role in increasing brand equity. Finally, the finding of this study suggests that personal challenge, information quality, system quality, and interactivity should be enhanced preferentially.