Cart (Loading....) | Create Account
Close category search window

Continuous call double auctions with indivisibility constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dani, A.R. ; Inst. for Dev. & Res. in Banking Technol., Hyderabad, India ; Pujari, A.K. ; Gulati, V.P.

Double sided auctions provide an efficient mechanism to implement bidding based many to many negotiations. In these auctions, sellers and buyers submit asks and bids respectively. These bids and asks are matched and cleared periodically. Efficient algorithms exist to match these asks and bids in case there are no assignment constraints. In some problems, there can be situations where the supply from different asks cannot be combined to satisfy a demand. Such constraints are also called as indivisible demand bid constraints. In this paper, we attempt to investigate the problem with indivisible demand constraints. An algorithm that generates optimum solution is also presented.

Published in:

e-Technology, e-Commerce and e-Service, 2005. EEE '05. Proceedings. The 2005 IEEE International Conference on

Date of Conference:

29 March-1 April 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.