• Industrial Engineering and Management Systems
• /
• v.8 no.4
• /
• pp.201-212
• /
• 2009

This study analyzed the structure of pricing in the automobile auction market by using real trade data. We focused on the bidding behavior of bidders and the contract price of exhibits. First, we proposed a relational framework among exhibits, number of bidders, and the contract price. Next, we utilized a neural network model to estimate the number of bidders and the contract price. Subsequently, we investigated the relationship between the number of bidders and the contact price, and evaluated our method through an analysis that employed verifying data. Lastly, we listed our suggestions for bidding in auction markets.

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

• Environmental and Resource Economics Review
• /
• v.10 no.2
• /
• pp.173-216
• /
• 2001

We compare impacts of different $CO_2$ abatement mechanisms using a CGE model. Focus is on the way the tradable permits are initially distributed for emissions trading, namely auction and grandfathering. For three major energy consuming industries (basic chemical, iron & steel and electricity) in Korea, emissions trading is clearly superior to individual $CO_2$ abatement, but auction and grandfathering show somewhat different patterns of impact. We show that depending on how the government uses the revenue from permit auction, auction may be preferable to grandfathering.

• Asia pacific journal of information systems
• /
• v.17 no.1
• /
• pp.95-121
• /
• 2007

There are recently several studies of online auctions which have focused on exploring a bidder's bidding behavior in IS area. Those studies, however, have been limited to account for bidders' bidding behavior in the view of TAM and trust, not considering perceived price fairness and competition intensity. Although this view point seems reasonable in the online auction sites, few previous studies employing this perspective are found in the relevant literatures. Based on it, this study developed a comprehensive model based on trust and TAM in terms of perceived price fairness to explain competition intensity in the online auction sites. This study collected 269 survey responses from online bidders who have prior experiences with online auction sites. The survey data are used to empirically verify 11 research hypothesis by using LISREL. The results indicate that trust in websites, trust in sellers and perceived usefulness have significant impacts on perceived price fairness. Finally, perceived price fairness is strongly related to competition intensity in the online auction. This study ends with theoretical and managerial implications, as well as limitations and future research.

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

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

• Journal of Convergence for Information Technology
• /
• v.11 no.2
• /
• pp.31-40
• /
• 2021

Blockchain technology is also actively studied in the real estate transaction field, and real estate transactions have various ways. In this paper, we propose a model that simplifies the authentication procedure of auction systems using Ethereum's Ether to solve the problem of offline court auctions. The proposed model is written in Ethereum's Solidity language, the court registers the sale date and the sale date with the DApp browser, and the bidder accesses the address of the individual's wallet created through Metamask's private key. The bidder then selects the desired sale and enters the bid price amount to participate in the auction. The bidder's record of the highest bid price for the sale he wants is written on the Ethereum test network as a smart contract. and creates a block. Finally, smart contracts written on the network are distributed by the court auction manager to all nodes in the blockchain network, and each node in the blockchain network can be viewed and contract verified. As a result of analyzing the smart contracts of the proposed model and the performance of the system, there are fees incurred due to the creation and use of Ether on platforms using Ethereum, and participation. Ether's changes in value affect the price of the sale, resulting in inconsistent fees in smart contracts each time. However, in future work, we issue our own tokens to solve the market volatility problem and commission problem with the value change of Ether, and refine complex court auction systems.

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

• Annual Conference of KIPS
• /
• 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 the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2006

Importance of and need for grid resource management have accelerated in accordance with increasing development of grid computing. However, it is very complex to distribute and utilize resources efficiently in geographically dispersed environments. This is due to the different access policies and constraints of grid resource owners. Users request resources according to their needs. Operators of a grid computing system need to be able to monitor the system states for reflecting these demands. So, a grid computing system needs a resource management policy that monitors states of resources and then allocates resources. This paper proposes a user demand-based grid trade management model that provides an efficient resource management by the trade allocation based on a users' demand and providers' supply strategy. To evaluate performance, this paper measures increasing rate of resource trades, average response time of trades, and processing time utilization. Firstly, the average increasing rates of trade are 585.7% and 322.6% higher than an auction model and a double auction model. Secondly, the average response time of the user demand-based grid trade management model is maintained between 3 and 5 simulation time. Finally, it is found that the processing time utilization is an average of 145.4% and 118.0% higher than an auction model and a double auction model. These empirical results demonstrate the usefulness of the user demand-based grid trade management model.