How Much Is a Dollar Worth? Tipping versus Equilibrium Coexistence on Competing Online Auction Sites

Background: Number of resource allocation and bidding schemes had been enormously arrived for on demand supply scheme of cloud services. But accessing and presenting the Cloud services depending on the reputation would not produce fair result in cloud computing. Since the cloud users not only looking for the efficient services but in major they look towards the cost. So here there is a way of introducing the bidding option system that includes efficient user centric behavior analysis model to render the cloud services and resource allocation with low cost. Objective: The allocation of resources is not flexible and dynamic for the users in the recent days. This gave me the key idea and generated as a problem statement for my proposed work. Methods: An online auction framework that ensures multi bidding mechanism which utilizes user centric behavioral analysis to produce the efficient and reliable usage of cloud resources according to the user choice. Results: we implement Efficient Resource Allocation using Multi Bidding Model with User Centric Behavior Analysis. Thus the algorithm is implemented and system is designed in such a way to provide better allocation of cloud resources which ensures bidding and user behavior. Conclusion: Thus the algorithm Efficient Resource Allocation using Multi Bidding Model with User Centric Behavior Analysis is implemented & system is designed in such a way to provide better allocation of cloud resources which ensures bidding, user behavior. The user bid data is trained accordingly such that to produce efficient resource utilization. Further the work can be taken towards data analytics and prediction of user behavior while allocating the cloud resources.

Download Full-text

An exploratory investigation of problematic online auction behaviors: Experiences of eBay users

Journal of Retailing and Consumer Services ◽

10.1016/j.jretconser.2006.02.002 ◽

2007 ◽

Vol 14 (1) ◽

pp. 1-16 ◽

Cited By ~ 36

Author(s):

Cara Peters ◽

Charles D. Bodkin

Keyword(s):

Online Auction ◽

Exploratory Investigation

Download Full-text

Determinants of Nonpaying Bid Behavior in Online Auction Platforms

Journal of Internet Commerce ◽

10.1080/15332861.2021.1889817 ◽

2021 ◽

pp. 1-28

Author(s):

ChienHsing Wu ◽

Shu-Chen Kao ◽

ChengHsun Ho

Keyword(s):

Online Auction

Download Full-text

An online auction mechanism for time-varying multidimensional resource allocation in clouds

Future Generation Computer Systems ◽

10.1016/j.future.2020.04.029 ◽

2020 ◽

Vol 111 ◽

pp. 27-38 ◽

Cited By ~ 1

Author(s):

Jixian Zhang ◽

Xutao Yang ◽

Ning Xie ◽

Xuejie Zhang ◽

Athanasios V. Vasilakos ◽

...

Keyword(s):

Resource Allocation ◽

Online Auction ◽

Time Varying ◽

Auction Mechanism

Download Full-text

Recommendation of Online auction Items Focusing Collaborative Filtering

2007 International Conference on Wireless Communications, Networking and Mobile Computing ◽

10.1109/wicom.2007.1518 ◽

2007 ◽

Cited By ~ 1

Author(s):

Xuefeng Li ◽

Guoping Xia ◽

Weijia You ◽

Zhao Zhang

Keyword(s):

Collaborative Filtering ◽

Online Auction

Download Full-text

Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel

Mathematical Problems in Engineering ◽

10.1155/2013/172718 ◽

2013 ◽

Vol 2013 ◽

pp. 1-5 ◽

Cited By ~ 1

Author(s):

Yi Sun ◽

Qiaoyan Wen ◽

Yudong Zhang ◽

Hua Zhang ◽

Zhengping Jin

Keyword(s):

Homomorphic Encryption ◽

Privacy Preserving ◽

Secure Multiparty Computation ◽

Online Auction ◽

Multiparty Computation ◽

Sequencing Problem ◽

The Core ◽

Secure Protocol ◽

Core Issue

As a powerful tool in solving privacy preserving cooperative problems, secure multiparty computation is more and more popular in electronic bidding, anonymous voting, and online auction. Privacy preserving sequencing problem which is an essential link is regarded as the core issue in these applications. However, due to the difficulties of solving multiparty privacy preserving sequencing problem, related secure protocol is extremely rare. In order to break this deadlock, this paper first presents an efficient secure multiparty computation protocol for the general privacy-preserving sequencing problem based on symmetric homomorphic encryption. The result is of value not only in theory, but also in practice.

Download Full-text