Cited By
View all- Greco GManna M(2024)Discrete preference games with logic-based agentsArtificial Intelligence10.1016/j.artint.2024.104131332:COnline publication date: 1-Jul-2024
Boolean Games: Inferring Agents' Goals Using Taxation Queries
Pages 1735 - 1737
Abstract
In Boolean games, each agent controls a set of Boolean variables and has a goal represented by a propositional formula. We initiate a study of inference in Boolean games assuming the presence of a PRINCIPAL who has the ability to control the agents and impose taxation schemes. Previous work used taxation schemes to guide a game towards certain equilibria. We show how taxation schemes can also be used to infer agents' goals. In our formulation, agents' goals are assumed to be unknown and the objective of the PRINCIPAL is to infer the goals of all the agents using appropriate taxation queries. Using an undirected graph (called the goal overlap graph) associated with a Boolean game, we establish necessary and sufficient conditions for the existence of a Nash equilibrium for any taxation query. Using these conditions, we develop an algorithm that uses taxation queries to learn agents' goals. Using a valid node coloring of the goal overlap graph, we show that goals of many agents can be inferred simultaneously. We also present more efficient (in terms of number of queries) goal inference algorithms for two special classes of Boolean functions, namely threshold and symmetric functions.
References
[1]
Hasan Abasi, Nader H. Bshouty, and Hanna Mazzawi. 2014. On Exact Learning Monotone DNF from Membership Queries. CoRR, Vol. abs/1405.0792 (2014), 1--16.
[2]
Abhijin Adiga, Chris J Kuhlman, Madhav Marathe, S Ravi, and Anil Vullikanti. 2019. PAC Learnability of Node Functions in Networked Dynamical Systems. In International Conference on Machine Learning. PMLR, Nagoya, Japan, 82--91.
[3]
Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, and Richard E. Stearns. 2018. Learning the Behavior of a Dynamical System Via a "20 Questions" approach. In Thirty second AAAI Conference on Artificial Intelligence. AAAI Press, Palo Alto, CA, 4630--4637.
[4]
Thomas Ågotnes, Paul Harrenstein, Wiebe Van Der Hoek, and Michael Wooldridge. 2013. Verifiable equilibria in boolean games. In Twenty-Third International Joint Conference on Artificial Intelligence. AAAI Press, Palo Alto, CA, 689--695.
[5]
Elise Bonzon, Marie-Christine Lagasquie-Schiex, and Jérôme Lang. 2006. Boolean games revisited. In Proc. ECAI. IOS Press, Amsterdam, The Netherlands, 265--269.
[6]
Elise Bonzon, Marie-Christine Lagasquie-Schiex, and Jérôme Lang. 2007. Dependencies between players in Boolean games. In European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Springer, Hidelberg, Germany, 743--754.
[7]
Sofie De Clercq, Steven Schockaert, Ann Nowé, and Martine De Cock. 2015. Multilateral negotiation in Boolean games with incomplete information using generalized possibilistic logic. In Twenty-Fourth International Joint Conference on Artificial Intelligence. AAAI Press, Palo Alto, CA, 2890--2896.
[8]
John Fearnley, Martin Gairing, Paul W Goldberg, and Rahul Savani. 2015. Learning equilibria of games via payoff queries. The Journal of Machine Learning Research, Vol. 16, 1 (2015), 1305--1344.
[9]
Drew Fudenberg and David K Levine. 1998. The theory of learning in games . Vol. 2. MIT press, Cambridge, MA.
[10]
John Grant, Sarit Kraus, Michael Wooldridge, and Inon Zuckerman. 2014. Manipulating games by sharing information. Studia Logica, Vol. 102, 2 (2014), 267--295.
[11]
Paul Harrenstein, Wiebe van der Hoek, John-Jules Meyer, and Cees Witteveen. 2001. Boolean games. In Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge. Morgan Kaufmann Publishers Inc., Burlington, MA, 287--298.
[12]
Xinran He, Ke Xu, David Kempe, and Yan Liu. 2016. Learning influence functions from incomplete observations. In Advances in Neural Information Processing Systems. Neural Information Systems Processing Foundation, San Diego, CA, 2073--2081.
[13]
Michael J Kearns and Umesh Virkumar Vazirani. 1994. An Introduction to Computational Learning Theory. MIT Press, Cambridge, MA.
[14]
Jon Kleinberg, Sendhil Mullainathan, and Johan Ugander. 2017. Comparison-based choices. In Proceedings of the 2017 ACM Conference on Economics and Computation. ACM, New York, NY, 127--144.
[15]
R. Laubenbacher and B. Stigler. 2004. A computational algebra approach to the reverse engineering of gene regulatory networks. J. Theoretical Biology, Vol. 229 (2004), 523--537.
[16]
Vadim Levit, Tal Grinshpoun, and Amnon Meisels. 2013a. Boolean games for charging electric vehicles. In Proceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)-Volume 02. IEEE Computer Society, Washington, DC, 86--93.
[17]
Vadim Levit, Tal Grinshpoun, Amnon Meisels, and Ana LC Bazzan. 2013b. Taxation search in boolean games. In Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, USA, 183--190.
[18]
V. Levitt, Z. Komarovsky, T. Grinshpoun, and A. L. C. Bazzan. 2019. Incentive-based search for equilibria in Boolean games. Constraints, Vol. 24 (2019), 288--319.
[19]
Kevin P Murphy. 1996. Passively learning finite automata. Technical Report 96-04-017. Santa Fe Institute, Santa Fe, NM.
[20]
Harikrishna Narasimhan, David C Parkes, and Yaron Singer. 2015. Learnability of influence in networks. In Advances in Neural Information Processing Systems. Neural Information Systems Processing Foundation, San Diego, CA, 3186--3194.
[21]
J. S. Provan and M. O. Ball. 1983. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM J. Computing, Vol. 12, 4 (1983), 777--788.
[22]
Luigi Sauro and Serena Villata. 2013. Dependency in cooperative boolean games. Journal of Logic and Computation, Vol. 23, 2 (2013), 425--444.
[23]
Michael Wooldridge, Ulle Endriss, Sarit Kraus, and Jérôme Lang. 2013. Incentive engineering for Boolean games. Artificial Intelligence, Vol. 195 (2013), 418--439.
Index Terms
- Boolean Games: Inferring Agents' Goals Using Taxation Queries
Recommendations
Designing incentives for Boolean games
AAMAS '11: The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1Boolean games are a natural, compact, and expressive class of logic-based games, in which each player exercises unique control over some set of Boolean variables, and has some logical goal formula that it desires to be achieved. A player's strategy set ...
Towards tractable Boolean games
AAMAS '12: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2Boolean games are a compact and expressive class of games, based on propositional logic. However, Boolean games are computationally complex: checking for the existence of pure Nash equilibria in Boolean games is Σp/2-complete, and it is co-NP-complete ...
Endogenous games with goals: side-payments among goal-directed agents
Boolean games have been developed as a paradigm for modelling societies of goal-directed agents. In boolean games agents exercise control over propositional variables and strive to achieve a goal formula whose realization might require the opponents' ...
Comments
Information & Contributors
Information
Published In
May 2020
2289 pages
ISBN:9781450375184
- General Chairs:
- Amal El Fallah Seghrouchni,
- Gita Sukthankar,
- Program Chairs:
- Bo An,
- Neil Yorke-Smith Yorke-Smith
Sponsors
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Published: 13 May 2020
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Funding Sources
- NSF
- Ministry of Education Science Research & Sport Slovak Republic
- Ministry of Science & Technology Israel
Conference
AAMAS '19
Sponsor:
AAMAS '19: International Conference on Autonomous Agents and Multiagent Systems
May 9 - 13, 2020
Auckland, New Zealand
Acceptance Rates
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 32Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025
Other Metrics
Citations
Cited By
View all- Greco GManna M(2024)Discrete preference games with logic-based agentsArtificial Intelligence10.1016/j.artint.2024.104131332:COnline publication date: 1-Jul-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in