Authors:
A. R. Dani
1
;
V. P. Gulati
1
and
Arun K. Pujari
2
Affiliations:
1
Institute for Development and Research in Banking Technology, India
;
2
University of Hyderabad, India
Keyword(s):
Continuous call double auctions, assignment constraints, matching, clearing.
Related
Ontology
Subjects/Areas/Topics:
B2B, B2C and C2C
;
B2C/B2B Considerations
;
Business and Social Applications
;
Communication and Software Technologies and Architectures
;
e-Business
;
Enterprise Information Systems
;
e-Procurement and Web-Based Supply Chain Management
;
Intranet and Extranet Business Applications
;
Market-Spaces: Market Portals, Hubs, Auctions
;
Society, e-Business and e-Government
;
Software Agents and Internet Computing
;
Web Information Systems and Technologies
Abstract:
Today’s companies increasingly use Internet as the common communication medium for commercial transactions. Global connectivity and reach of Internet means that companies face increasing competition from various quarters. This requires that companies optimize the way they do business, change their business processes and introduce new business processes. This has opened up new research issues and electronic or automated negotiation is one such area. Few companies have tried to introduce electronic auctions for procurement and for trade negotiations. In the present paper, we propose a design of continuous call market, which can help enterprises in electronic procurement as well as selling items electronically. The design is based on double sided auctions, where multiple buyers and sellers submit their respective bids and asks. Buyers and sellers can also specify assignment constraints. The main feature of our work is an algorithm, which generates optimum matching with polynomial time c
omplexity under assignment constraints.
(More)