Abstract
In many multi-agent scenarios we encounter homogeneous groups of agents; agents that have the same actions available, and for which the system does not care who performs a given action, but only cares about how many agents perform it. Sometimes homogeneity is a descriptive fact, arising from a lack of interest in agents’ identity, or the fact that we are simply unable to distinguish between them. Other times, it is a normative requirement, for instance in the context of voting, where we do not want the outcome to depend on who voted for what, only on how many votes each candidate receives. Another important notion is anonymity, which also often arise in multi-agent scenarios, either because we do not know an agent’s identity, or else because the systems comes with an explicit commitment to ensure that this information is kept secret. Clearly, the two notions are closely related, and in this paper we explore the relationship that exists between them within the framework of Alternating-time Temporal Logic. We add an homogeneity axiom to this logic, and proceed to show that the resulting logic, which we dub hatl, is sound and complete with respect to a class of structures that are both homogeneous and procedurally anonymous, meaning that no information whatsoever needs to be maintained about the actions of individual agents.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, p. 23. Springer, Heidelberg (1998)
Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM (JACM) 49(5), 672–713 (2002)
Blonski, M.: Characterization of pure strategy equilibria in finite anonymous games. Journal of Mathematical Economics 34, 225–233 (2000)
Brandt, F., Fischer, F., Holzer, M.: Symmetries and the complexity of pure nash equilibrium. Journal of Computer and System Sciences 75(3), 163–177 (2009)
Campbell, D., Fishburn, P.: Anonymity conditions in social choice theory. Theory and Decision 12(1), 21–39 (1980)
Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65–75 (1988)
Daskalakis, C., Papadimitriou, C.: Computing equilibria in anonymous games. In: 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 83–93 (2007)
Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of alternating-time temporal logic. Theor. Comput. Sci. 353(1-3), 93–117 (2006)
Halpern, J.Y., O’Neill, K.R.: Anonymity and information hiding in multiagent systems. J. Comput. Secur. 13(3), 483–514 (2005)
Jamroga, W., Dix, J.: Do agents make model checking explode (computationally)? In: Pěchouček, M., Petta, P., Varga, L.Z. (eds.) CEEMAS 2005. LNCS (LNAI), vol. 3690, pp. 398–407. Springer, Heidelberg (2005)
Parikh, R.: Social software. Synthese 132, 200–202 (2001)
Pedersen, T., Dyrkolbotn, S., Kaźmierczak, P., Parmann, E.: Concurrent game structures with roles. In: Mogavero, F., Murano, A., Vardi, M.Y. (eds.) Proceedings 1st International Workshop on Strategic Reasoning, Rome, Italy, March 16-17. Electronic Proceedings in Theoretical Computer Science, vol. 112, pp. 61–69. Open Publishing Association (2013)
Van Ditmarsch, H., Van Der Hoek, W., Kooi, B.: Dynamic epistemic logic, vol. 337. Springer (2007)
van Eijck, J., Orzan, S.: Epistemic verification of anonymity. Electron. Notes Theor. Comput. Sci. 168, 159–174 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedersen, T., Dyrkolbotn, S.K. (2013). Agents Homogeneous: A Procedurally Anonymous Semantics Characterizing the Homogeneous Fragment of ATL. In: Boella, G., Elkind, E., Savarimuthu, B.T.R., Dignum, F., Purvis, M.K. (eds) PRIMA 2013: Principles and Practice of Multi-Agent Systems. PRIMA 2013. Lecture Notes in Computer Science(), vol 8291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44927-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-44927-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44926-0
Online ISBN: 978-3-642-44927-7
eBook Packages: Computer ScienceComputer Science (R0)