article

Construction of negotiation protocols for e-commerce applications

Authors:

Nikolay Diakov,

Stanislav PokraevAuthors Info & Claims

ACM SIGecom Exchanges, Volume 5, Issue 2

Pages 12 - 22

https://doi.org/10.1145/1120687.1120690

Published: 01 November 2004 Publication History

Abstract

A company doing e-business needs capabilities to negotiate electronically the parameters of its deals in order to fully utilize the potential of the Information and Communication technology (ICT). This paper focuses on construction of negotiation protocols for e-commerce with the following properties: (a) formal semantics, (b) compositionally constructed, and (c) dynamically reconfigurable. We apply the Reo coordination language to demonstrate that one can specify and implement negotiation protocols possessing the desired properties.

References

[1]

AALST VAN DER, W.M.P. 2003. Don't go with the flow: Web services composition standards ex-posed. Trends and Controversies, IEEE Intelligent Systems, Jan/Feb.

[2]

ARBAB, F. 2003. Abstract Behavior Types: A Foundation Model for Components and Their Composition. In Proceedings of the First International Symposium on Formal Methods for Components and Objects (FMCO 2002), LNCS 2852, pp. 33-70.

[3]

ARBAB, F., BAIER, C., RUTTEN, J. AND SIRJANI, M. 2004a. Modeling Component Connectors in Reo by Constraint Automata. Electronic Notes in Theoretical Computer Science, vol. 97, No. 22, July, pp. 25-46.

[4]

ARBAB, F., BAIER, C., DE BOER, F. AND RUTTEN, J. 2004b. Models and Temporal Logics for Timed Component Connectors, In Proc. of the IEEE International Conference on Software Engineering and Formal Methods (SEFM '04), Beijing, China, 26-30 September.

Digital Library

[5]

ARBAB, F. AND MAVADATT, F. 2002. Coordination through channel composition. In Coordination Languages and Models: Proc. Coordination 2002, volume 2315 of Lecture Notes in Computer Science, Springer-Verlag, pp. 21-38.

Digital Library

[6]

ARBAB, F. 2004. Reo: A Channel-based Coordination Model for Component Composition, Mathematical Structures in Computer Science. Cambridge University Press, Vol. 14, No. 3, June, pp. 329-366.

Digital Library

[7]

ARBAB, F. AND RUTTEN, J. 2003. A Coinductive Calculus of Component Connectors. In Proceedings of 16th International Workshop on Algebraic Development Techniques (WADT 2002), Lecture Notes in Computer Science 2755, Springer, pp. 35-56.

[8]

BARBUCEANU, M. AND FOX, M.S. 1995. COOL: A language for Describing Coordination in Multi Agent Systems. In Proc. First International Conference on Multi-Agent Systems (ICMAS'95), pp. 17-24.

[9]

BOWER, J. L. AND CHRISTENSEN, C. M. 1995. Disruptive technologies: catching the wave, Harvard Business Review, 73, 1 (January-February), pp. 43-53.

[10]

BPMI.org, BPML 1.0 Specification, online available at: http://www.bpmi.org/specifications.esp

[11]

CHRISTENSEN, C.M. 1997. The Innovator's Dilemma. Harvard Business School Press, Boston, Mass.

[12]

CURBERA, F., GOLAND, Y., KLEIN, J., LEYMAN, F., ROLLER, D., THATTE, S. AND WEERAWARANA, S. 2003. Business Process Execution Language for Web Services (BPEL4WS) 1.1, May 2003, online available at: http://www.ibm.com/developerworks/library/ws-bpel/

[13]

EVERAARS, K., COSTA, D., DIAKOV, N.K. AND ARBAB, F. 2004. Reo Rewrite Rules: Functional Specification, work in progress. Presented at The Amsterdam Coordination Group (ACG), May.

[14]

GUILLEN-SCHOLTEN, J. 2004. A Translation from Reo to Petri Nets and Vice-Versa. Work in progress, presented at the The Amsterdam Coordination Group (ACG), June.

[15]

JENNINGS, N., FARATIN, P., LOMUSCIO, A., PARSONS, S., SIERRA, C. AND WOOLDRIDGE M. 2001. Automated Negotiation: Prospects, Methods and Challenges, Int Journal of Group Decision and Negotiation, vol. 10, no. 2, pp. 199-215.

[16]

KIM, J.B., SEGEV, A., PATANKAR, A.K. AND CHO, M.G. 2003. Web Services and BPEL4WS for Dynamic eBusiness Negotiation Processes, In Proceedings of the International Conference on Web Services (ICWS '03), Las Vegas, Nevada, USA, L. ZHANG, Ed., CSREA Press 2003, pp. 111-117.

[17]

KUWABARA, K., ISHIDA, T., AND OSATO, N. 1995a. AgenTalk: Describing Multiagent Coordination Protocols with Inheritance. Proc. 7th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '95), pp. 460-465.

Digital Library

[18]

KUWABARA, K., ISHIDA, T., AND OSATO, N. 1995b. AgenTalk: Coordination Protocol Description for Multiagent Systems. Proc. First International Conference on Multi-Agent Systems (ICMAS '95), p. 455.

[19]

MALONE, T.W., YATES, J. AND BENJAMIN, R.I. 1987. Electronic Markets and Electronic Hierarchies. Communications of the ACM, vol. 30, June, pp. 484-497.

Digital Library

[20]

MOUSAVI, M.R., SIRJANI, M. AND ARBAB, F. 2004. Specification, Simulation, and Verification of Component Connectors in Reo, Technical Report No. 04-15, Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, June.

[21]

POKRAEV, ST., ZLATEV, Z., BRUSSEE, R. AND ECK, P. VAN 2004. Semantic Support for Automated Negotiation with Alliances. In Proceedings of the Sixth International Conference on Enterprise Information Systems, ICEIS 2004, Porto INSTICC, Portugal, E. SERUCA {et al.} Eds., April 14-17, vol. 4, pp. 244-249.

[22]

RUTTEN, J., KWIATKOWSKA, M., GETHIN, N. AND PARKER., D. 2004. Component Connectors. Chapter 5 in Mathematical Techniques for analysing concurrent and probabilistic systems, CRM Monograph series Volume 23, American Mathematical Society, p. 215.

[23]

SHOR, M. Admin. 2004. Game Theory .net, Owen Graduate School of Management, Vanderbilt University, online available at: http://www.gametheory.net/Dictionary/Auctions/ProcurementAuction.html

[24]

W3C 2002. Web Services Conversation Language (WSCL) 1.0, W3C Note, March, online available at: http://www.w3.org/TR/wscl10/

[25]

WEERAWARANA, S. AND CURBERA, F. P. 2002. Concepts in business processes, online available at: http://www-106.ibm.com/developerworks/webservices/library/ws-bpelcol1/

Cited By

Xu ZSun M(2023)Formal Modeling and Verification of Timed Connectors in IoT with Z32023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE)10.1109/CSCE60160.2023.00410(2556-2563)Online publication date: 24-Jul-2023
https://doi.org/10.1109/CSCE60160.2023.00410
Clarke D(2019)A Basic Logic for Reasoning about Connector ReconfigurationFundamenta Informaticae10.5555/1366982.136698682:4(361-390)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/1366982.1366986
Klüppelholz SBaier C(2019)Symbolic Model Checking for Channel-based Component ConnectorsElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2007.03.003175:2(19-37)Online publication date: 5-Jan-2019
https://dl.acm.org/doi/10.1016/j.entcs.2007.03.003
Show More Cited By

Index Terms

Construction of negotiation protocols for e-commerce applications

Recommendations

Detecting opponent concessions in multi-issue automated negotiation
ICEC '06: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet

An agent engaged in multi-issue automated negotiation can benefit greatly from learning about its opponent's preferences. Knowledge of the opponent's preferences can help the agent not only to find mutually acceptable agreements more quickly, but also ...
Assimilating ontological additions in convergent negotiation protocols
ICEC '07: Proceedings of the ninth international conference on Electronic commerce

We consider negotiation protocols in which each offer contains a price and a description from some given ontology. If the opposing negotiation agents do not share the same version of this ontology, for instance because not all have been made aware of ...
Intelligent agents for automated one-to-many e-commerce negotiation

Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current automated negotiation systems support one-to-one negotiation. One-to-many ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGecom Exchanges

ACM SIGecom Exchanges Volume 5, Issue 2

November, 2004

53 pages

EISSN:1551-9031

DOI:10.1145/1120687

Issue’s Table of Contents

Copyright © 2004 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2004

Published in SIGECOM Volume 5, Issue 2

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
325
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Xu ZSun M(2023)Formal Modeling and Verification of Timed Connectors in IoT with Z32023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE)10.1109/CSCE60160.2023.00410(2556-2563)Online publication date: 24-Jul-2023
https://doi.org/10.1109/CSCE60160.2023.00410
Clarke D(2019)A Basic Logic for Reasoning about Connector ReconfigurationFundamenta Informaticae10.5555/1366982.136698682:4(361-390)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/1366982.1366986
Klüppelholz SBaier C(2019)Symbolic Model Checking for Channel-based Component ConnectorsElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2007.03.003175:2(19-37)Online publication date: 5-Jan-2019
https://dl.acm.org/doi/10.1016/j.entcs.2007.03.003
Clarke D(2019)Reasoning About Connector Reconfiguration IIElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.12.062159(61-77)Online publication date: 5-Jan-2019
https://dl.acm.org/doi/10.1016/j.entcs.2005.12.062
Hong WNawaz MZhang XLi YSun M(2018)Using Coq for Formal Modeling and Verification of Timed ConnectorsSoftware Engineering and Formal Methods10.1007/978-3-319-74781-1_37(558-573)Online publication date: 2-Feb-2018
https://doi.org/10.1007/978-3-319-74781-1_37
Palomar EChen XLiu ZMaharjan SBowen J(2016)Component-Based Modelling for Scalable Smart City Systems Interoperability: A Case Study on Integrating Energy Demand Response SystemsSensors10.3390/s1611181016:11(1810)Online publication date: 28-Oct-2016
https://doi.org/10.3390/s16111810
Deochake SSarode SKanth SPotdar VChakraborty SMukhopadhyay DPotdar VMukhopadhyay D(2012)HENRIProceedings of the CUBE International Information Technology Conference10.1145/2381716.2381840(647-652)Online publication date: 3-Sep-2012
https://dl.acm.org/doi/10.1145/2381716.2381840
Klüppelholz SBaier C(2009)Symbolic model checking for channel-based component connectorsScience of Computer Programming10.1016/j.scico.2008.09.02074:9(688-701)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1016/j.scico.2008.09.020
Clarke D(2008)A Basic Logic for Reasoning about Connector ReconfigurationFundamenta Informaticae10.5555/2365256.236526082:4(361-390)Online publication date: 1-Dec-2008
https://dl.acm.org/doi/10.5555/2365256.2365260
Arbab F(2006)Coordination for Component CompositionElectronic Notes in Theoretical Computer Science10.1016/j.entcs.2006.05.013160(15-40)Online publication date: Aug-2006
https://doi.org/10.1016/j.entcs.2006.05.013
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents