Abstract
Despite the fact that social computation systems involve interaction mechanisms that closely resemble well-known models of agent coordination, current applications in this area make little or no use of the techniques the agent-based systems literature has to offer. In order to bridge this gap, this paper proposes a data-driven method for defining and deploying agent interaction protocols that is entirely based on using the standard architecture of the World Wide Web. This obviates the need of bespoke message passing mechanisms and agent platforms, thereby facilitating the use of agent coordination principles in standard Web-based applications. We describe a prototypical implementation of the architecture and experimental results that prove it can deliver the scalability and robustness required of modern social computation applications while maintaining the expressiveness and versatility of agent interaction protocols.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Different types \(D_j\) can be used here to accommodate different types of variables. These are omitted for simplicity.
- 2.
Throughout the paper, we adopt the convention of referring to elements in a structure \(x=\langle y, y',\ldots \rangle \) as y(x), \(y'(x)\) etc.
- 3.
Allowing many senders in messages may seem counter-intuitive at first, but is useful for situations where a physical sender acts on behalf of a whole group, or to summarise identical messages received from various peers as one message in the data-driven model we introduce in Sect. 4.
- 4.
Note that different semantics are possible here, which may assume that senders also have a modified state regarding their perception of receivers’ local variables after sending a message, or receivers inferring facts about senders’ previous states upon receipt of a message. Which of these variants is chosen is not essential for the material provided below.
- 5.
The superscript (k) is added to the succ function here to indicate that op requires this number of timesteps.
- 6.
References
Ahmad, S., Battle, A., Malkani, Z., Kamvar, S.D.: The Jabberwocky programming environment for structured social computing. In: Proceedings of the 24th Annual ACM Symposium on User Interface Software and Technology (UIST 2011), pp. 53–64, Santa Barbara, CA (2011)
Ardissono, L., Goy, A., Petrone, G.: Enabling conversations with Web services. In: Rosenschein, J.S., Sandholm, T., Wooldridge, M., Yokoo, M. (eds.) Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2003), pp. 819–826 (2003)
Chopra, A.K., Artikis, A., Bentahar, J., Colombetti, M., Dignum, F., Fornara, N., Jones, A.J.I., Singh, M.P., Yolum, P.: Research directions in agent communication. ACM Trans. Intell. Syst. Technol. 4(2), 1–23 (2013)
Englemore, R., Morgan, T. (eds.): Blackboard Systems. Addison-Wesley, Reading (1988)
Fielding, R.T., Taylor, R.N.: Principled design of the modern web architecture. ACM Trans. Internet Technol. 2(2), 115–150 (2002)
Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3–4), 189–208 (1971)
Gelernter, D., Carriero, N.: Coordination languages and their significance. Commun. ACM 35(2), 97–107 (1992)
Law, E., Von Ahn, L.: Human Computation. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2011)
Little, G., Chilton, L.B., Goldman, M., Miller, R.C.: TurKit: human computation algorithms on mechanical turk. In: Proceedings of the 23nd Annual ACM Symposium on User Interface Software and Technology (UIST 2010), pp. 57–66 (2010)
Malone, T.W., Laubacher, R., Dellarocas, C.: The collective intelligence genome. Sloan Manag. Rev. 51(3), 21–31 (2010)
Omicini, A., Zambonelli, F.: Tuple centres for the coordination of internet agents. In: Proceedings of the 4th ACM Symposium on Applied Computing, San Antonio, TX, February 1999
Robertson, D., et al.: Models of interaction as a grounding for peer to peer knowledge sharing. In: Dillon, T.S., Chang, E.J., Meersman, R., Sycara, K. (eds.) Advances in Web Semantics I. LNCS, pp. 81–129. Springer, Heidelberg (2007)
Rovatsos, M.: Multiagent systems for social computation. In: Lomuscio, A., Scerri, P., Bazzan, A., Huhns, M. (eds.) Proceedings of the 13th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2014), Paris, France, 5th–9th May 2014
Singh, M.P.: LoST: local state transfer - an architectural style for the distributed enactment of business protocols. In: Proceedings of the 9th International Conference on Web Services (ICWS), pp. 57–64, Washington, DC (2011)
Singh, M.P.: Semantics and Verification of Information-Based Protocols. In: Conitzer, V., Winikoff, M., Padgham, L., Van der Hoek, V. (eds.) Proceedings of the Eleventh International Conference on Autonomous Agents Multiagent Systems (AAMAS 2012), pp. 1149–1156, Valencia, Spain, June 4–8, 2012
Acknowledgments
The research presented in this paper has been funded by the European Community’s Seventh Framework Programme (FP7/2007–2013) under grant agreement n. 600854 “SmartSociety – Hybrid and Diversity-Aware Collective Adaptive Systems: Where people meet machines to build smarter societies” (http://www.smart-society-project.eu/).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rovatsos, M., Diochnos, D., Craciun, M. (2015). Agent Protocols for Social Computation. In: Koch, F., Guttmann, C., Busquets, D. (eds) Advances in Social Computing and Multiagent Systems. MFSC 2015. Communications in Computer and Information Science, vol 541. Springer, Cham. https://doi.org/10.1007/978-3-319-24804-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-24804-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24803-5
Online ISBN: 978-3-319-24804-2
eBook Packages: Computer ScienceComputer Science (R0)