• Journal of Korean Society for Quality Management
• /
• v.47 no.4
• /
• pp.687-700
• /
• 2019

Purpose: The purpose of this study is to investigate the interaction effects between price determinants of artworks. We expand the methodology in art market by applying machine learning techniques to estimate the price of artworks and compare linear regression and machine learning in terms of prediction accuracy. Methods: Moderated regression analysis was performed to verify the interaction effects of artistic characteristics on price. The moderating effects were studied by confirming the significance level of the interaction terms of the derived regression equation. In order to derive price estimation model, we use multiple linear regression analysis, which is a parametric statistical technique, and k-nearest neighbor (kNN) regression, which is a nonparametric statistical technique in machine learning methods. Results: Mostly, the influences of the price determinants of art are different according to the auction types and the artist 's reputation. However, the auction type did not control the influence of the genre of the work on the price. As a result of the analysis, the kNN regression was superior to the linear regression analysis based on the prediction accuracy. Conclusion: It provides a theoretical basis for the complexity that exists between pricing determinant factors of artworks. In addition, the nonparametric models and machine learning techniques as well as existing parameter models are implemented to estimate the artworks' price.

• The Journal of Information Systems
• /
• v.14 no.2
• /
• pp.55-74
• /
• 2005

In order to purchase a product cheaper, a lot of customers have been trying to search one or more marketplaces. Ever since the commercial use of the Internet, several types of marketplaces have been operating successfully on the Internet. Some of them are online shopping malls, auction markets, and group-buying markets. They have the price settlement mechanisms of their own. Online shopping malls where many stores are located support a customer to purchase the product that matches his/her requests such as price, function, design, and so forth. In online auction market, a customer can buy the product by making bids sequentially and competitively until a final price is reached. In online group-buying market, a customer can purchase the product by aggregating the orders from several buyers so that cheaper prices can be negotiated. The cheaper customers could purchase the same product item, the more satisfied they would be. However, it is very difficult for the customer to determine the marketplace to purchase, considering different kinds of marketplaces at the same time. Even though the purchasing price is cheapest in one marketplace, it is very difficult for customers to convince it the cheapest for all marketplaces. Therefore, rules and methods have been developed for purchase decision making in multiple marketplaces to reach the optimal purchase decision as a whole. They can maximize customer's utility and resolve the conflicts with other marketplaces through multi-agent negotiation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3638-3657
• /
• 2022

In urban vehicular edge computing (VEC) environments, one edge server always serves many task requests in its coverage which results in the resource-constrained problem. To resolve the problem and improve system utilization, we first design a general hierarchical resource management framework based on typical VEC network structures. Following the framework, a specific interacting protocol is also designed for our decision algorithm. Secondly, a greedy bidding-based multi-hop task scheduling decision algorithm is proposed to realize effective task scheduling in resource-constrained VEC environments. In this algorithm, the goal of maximizing system utility is modeled as an optimization problem with the constraints of task deadlines and available computing resources. Then, an auction mechanism named greedy bidding is used to match task requests to edge servers in the case of multiple hops to maximize the system utility. Simulation results show that our proposal can maximize the number of tasks served in resource constrained VEC networks and improve the system utility.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.17-25
• /
• 2003

In the current bandwidth mechanism, ISPs provide guaranteed internet bandwidth within itself domains. Also transmission of data through the network can cause congestion. An inevitable consequence is partly responsible for the difficulties to ISPs and customers. In economic views, multiple demands for a scarce resource are mediated through a bandwidth market. Using the auction-based admission algorithm In price congestion, I propose a different pricing scheme for statistically guaranteed QoS.

• Asian-Australasian Journal of Animal Sciences
• /
• v.23 no.7
• /
• pp.848-854
• /
• 2010

The objectives of this study were to estimate genetic parameters for the carcass price and carcass traits contributing to carcass grading and to investigate the influence of each carcass trait on the carcass price using multiple regression and path analyses. Data for carcass traits and carcass prices were collected from March 2003 to January 2009 on steers of Korean cattle raised at private farms. The analytical mixed animal model, including slaughter house-year-month combination, linear and quadratic slaughter age as fixed effects and random animal and residual effects, was used to estimate genetic parameters. The effects of carcass traits on the carcass price were evaluated by applying multiple regression analyses. Heritability estimates of carcass traits were $0.20{\pm}0.08$ for carcass weight (CWT), $0.33{\pm}0.10$ for back fat thickness (BFT), $0.07{\pm}0.05$ for eye-muscle area (EMA) and $0.25{\pm}0.10$ for marbling score (MS), and those of carcass prices were $0.21{\pm}0.10$ for auction price per 1 kg of carcass weight (AP) and $0.13{\pm}0.07$ for total price (CP). Genetic correlation coefficients of AP with CWT and MS were $-0.35{\pm}0.29$ and $0.99{\pm}0.04$, respectively, and those of CP with CWT and MS were $0.59{\pm}0.22$ and $0.39{\pm}0.29$ respectively. If an appropriate adjustment for temporal economic value is available, the moderate heritability estimates of AP and CP might suggest their potential use as the breeding objectives for improving the gross incomes of beef cattle farms. The large genetic correlation estimates of carcass price variables with CWT and MS implied that simultaneous selection for both CWT and MS would be also useful in enhancing income.

• Journal of Intelligence and Information Systems
• /
• v.9 no.1
• /
• pp.109-123
• /
• 2003

The relationship between suppliers and customers is treated importantly not only in the traditional business-to-business (BtoB) commerce but also in today's Internet environments. On the one hand, most of Internet-based BtoB commerce services like customer-centric e-procurement, supplier-centric e-sales or intermediary-centric e-marketplace focus mainly on the selection of partners according to bidding, auction, etc. This point may result in the problem of overlooking the relationships between suppliers and customers. To overcome this problem in this paper, an intelligent agents-based supply chain operation architecture is proposed and appraised considering the relationship and its adaptation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5537-5555
• /
• 2017

Having the characteristics of unlinkability, anonymity, and unforgeability, blind signatures are widely used for privacy-related applications such as electronic cash, electronic voting and electronic auction systems where to maintain the anonymity of the participants. Among these applications, the blinded message is needed for a certain purpose by which users delegate signing operation and communicate with each other in a trusted manner. This application leads to the need of proxy blind signature schemes. Proxy blind signature is an important type of cryptographic primitive to realize the properties of both blind signature and proxy signature. Over the past years, many proxy blind signature algorithms have been adopted to fulfill such task based on the discrete logarithm problem (DLP) and the elliptic curve discrete log problem (ECDLP), and most of the existing studies mainly aim to provide effective models to satisfy the security requirements concerning a single blinded message. Unlike many previous works, the proposed scheme applies the signcryption paradigm to the proxy blind signature technology for handling multiple blinded messages at a time based on elliptic curve cryptography (ECC). This innovative method thus has a higher level of security to achieve the security goals of both blind signature and proxy signature. Moreover, the evaluation results show that this proposed protocol is more efficient, consuming low communication overhead while increasing the volume of digital messages compared to the performance from other solutions. Due to these features, this design is able to be implemented in small low-power intelligent devices and very suitable and easily adoptable for e-system applications in pervasive mobile computing environment.

• Journal of Intelligence and Information Systems
• /
• v.10 no.2
• /
• pp.147-163
• /
• 2004

For the purchase of a cheaper product on the Internet, many customers have been trying to search online shopping mall sites and visit comparison-pricing shops that compare prices and other criteria of the product. Others have been participating into online auction markets or group-buying markets. However, a lot of online shopping malls, auction markets, and group-buying markets provide the same product with different prices. Since these marketplaces have different price settlement mechanism, it is very difficult for the customers to determine marketplace to purchase, considering different kinds of marketplaces at the same time. To overcome such limitations, decision rules and solution procedures for purchase decision making are necessary, which can cover multiple marketplaces simultaneously. For this purpose, purchase decision making in each market must be conducted to maximize customer's utility, and conflicts with other marketplaces must be resolved. Therefore, we have developed the rules and methods that can negotiate cooperatively the purchase decision making in several marketplaces, and designed an architecture of Intelligent Buyer Agent and a message structure to support the idea.

• Journal of Animal Science and Technology
• /
• v.52 no.2
• /
• pp.157-164
• /
• 2010

We investigated the influence of carcass traits on carcass price for Hanwoo cow using multiple regression and path analyses. Data for carcass traits and price were collected on mature Hanwoo cow raised in private farms in Kangwon province that were slaughtered in 2008. A total of 96 animals with the average slaughter age of 51 months were used in the current study. Of the carcass traits studied, marbling score (MAR), dressing percentage (DP), and eye-muscle area (EMA) showed moderate and positive correlations with auction price (AP), while correlation coefficients of meat yield index (MINDEX) with AP were low or even negligible. In multiple regression analyses of AP and carcass price (CP) on cold carcass weight (CWT), back fat thickness (BFT), EMA, MAR, and DP, estimates of $R^2$ were 69.86 and 85.43%, respectively. Partial regression coefficients for CWT, BFT, EMA, MAR and DP were -0.028, -0.106, 0.107, 0.814, and 0.075 in the equation of AP and 0.561, -0.060, 0.083, 0.590, and 0.051 in the equation of CP. In path analyses, MAR's total contribution on the variation of AP was largest (0.667), and the total contributions of MAR and CWT on the variation of CP were 0.403 and 0.397. The current study suggested that marbling was the most influential trait on the variation of auction price, and marbling and cold carcass weight were critical traits on the variation of carcass price.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.904-913
• /
• 2005

This paper deals with an integrated problem of inventory control and dynamic pricing strategies for a commodity with price and sales-period dependent demand pattern, where a seller and customers have complete information of each other. The problem consists of two parts; one is each buyer's benefit problem which makes the best decision on price and time for buyer to purchase items, and the other one is a seller's profit problem which decides an optimal sales strategy concerned with inventory control and discount schedule. The seller's profit function consists of sales revenue and inventory holding cost functions. The two parts are closely related into each other with some related variables, so that any existing general solution methods can not be applied. Therefore, a simplified model with single seller and two customers in considered first, where demand for multiple units is allowed to each customer within a time limit. Therewith, the model is generalized for a n-customer-classes problem. To solve the proposed n-customer-set problem, a dynamic programming algorithm is derived. In the proposed dynamic programming algorithm, an intermediate profit function is used, which is computed in case of a fixed initial inventory level and then adjusted in searching for an optimal inventory level. This leads to an optimal sales strategy for a seller, which can derive an optimal decision on both an initial inventory level and a discount schedule, in $O(n^2)$ time. This result can be used for some extended problems with a small customer set and a short selling period, including sales strategy for department stores, Dutch auction for items with heavy holding cost, open tender of materials, quantity-limited sales, and cooperative buying in the on/off markets.