Abstract
The paper analyzes interdependencies between strategies of players in a Nash equilibrium using independence relation between two sets of players. A sound and complete axiomatization of this relation is given. It has been shown previously that the same axiomatic system describes independence in probability theory, information flow, and concurrency theory.
This is a preview of subscription content, log in via an institution to check access.
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
Moivre, Abraham, de. In: The New Encyclopædia Britannica, 15th edn., vol. 8, p.226. Encyclopædia Britannica (1998)
de Moivre, A.: De mensura sortis seu; de probabilitate eventuum in ludis a casu fortuito pendentibus. Philosophical Transactions (1683-1775) 27, 213–264 (1711)
de Moivre, A.: Doctrine of Chances (1718)
Geiger, D., Paz, A., Pearl, J.: Axioms and algorithms for inferences involving probabilistic independence. Inform. and Comput. 91(1), 128–141 (1991)
Studený, M.: Conditional independence relations have no finite complete characterization. In: Transactions of the 11th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, vol. B, pp. 377–396. Kluwer, Dordrecht (1990)
Sutherland, D.: A model of information. In: Proceedings of Ninth National Computer Security Conference, pp. 175–183 (1986)
Miner More, S., Naumov, P.: An independence relation for sets of secrets. Studia Logica 94(1), 73–85 (2010)
Cohen, E.: Information transmission in computational systems. In: Proceedings of Sixth ACM Symposium on Operating Systems Principles, Association for Computing Machinery, pp. 113–139 (1977)
Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. ACM Trans. Inf. Syst. Secur. 12(1), 1–47 (2008)
Miner More, S., Naumov, P.: On interdependence of secrets in collaboration networks. In: Proceedings of 12th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 208–217. Stanford University, Stanford (2009)
Donders, M., More, S.M., Naumov, P.: Information flow on directed acyclic graphs. In: Beklemishev, L., de Queiroz, R. (eds.) Proceedings of 18th Workshop on Logic, Language, Information and Computation, Philadelphia, United States, pp. 95–109. Springer, Heidelberg (2011)
Miner More, S., Naumov, P.: Hypergraphs of multiparty secrets. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds.) CLIMA XI. LNCS(LNAI), vol. 6245, pp. 15–32. Springer, Heidelberg (2010)
Miner More, S., Naumov, P., Sapp, B.: Concurrency semantics for the Geiger-Paz-Pearl axioms of independence. In: 20th Conference on Computer Science Logic (CSL 2011), Bergen, Norway (to appear, September 2011)
Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf. 1, 115–138 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naumov, P., Nicholls, B. (2011). Game Semantics for the Geiger-Paz-Pearl Axioms of Independence. In: van Ditmarsch, H., Lang, J., Ju, S. (eds) Logic, Rationality, and Interaction. LORI 2011. Lecture Notes in Computer Science(), vol 6953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24130-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-24130-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24129-1
Online ISBN: 978-3-642-24130-7
eBook Packages: Computer ScienceComputer Science (R0)