Incentive-based search for equilibria in Boolean games

DOI10.1007/S10601-019-09304-YMaRDI QIDQ2009196zbMATH OpenOpenAlexWikidataFDO

Authors Vadim E. Levit, Zohar Komarovsky, Tal Grinshpoun, Ana L. C. Bazzan, Amnon Meisels

Publication date 27 November 2019

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-019-09304-y

zbMATH Keywords

Boolean gamesdistributed searchdistributed constraints reasoningincentive-based equilibriaside-payments in multi-agents games

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Noncooperative games (91A10) Distributed algorithms (68W15)

Recommendations

• Incentive engineering for Boolean games
• Incentive-based search for efficient equilibria of the public goods game
• Behavioural strategies in weighted Boolean games
• Hard and soft preparation sets in Boolean games
• The complexity of decision problems about equilibria in two-player Boolean games

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2038846 (Why is no real title available?)
• scientific article; zbMATH DE number 1396804 (Why is no real title available?)
• scientific article; zbMATH DE number 6469241 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• A course in game theory.
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Algorithmic Game Theory
• Anti-coordination games and stable graph colorings
• Asymmetric distributed constraint optimization problems
• Concurrent forward bounding for distributed constraint optimization problems
• Concurrent search for distributed CSPs
• Dependencies between players in Boolean games
• Dependency in cooperative Boolean games
• Distributed search by constrained agents. Algorithms, performance, communication.
• Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Emergence of Scaling in Random Networks
• Endogenous Games and Mechanisms: Side Payments Among Players
• Forward bounding on pseudo-trees for DCOPs and ADCOPs
• Hard and soft preparation sets in Boolean games
• Incentive engineering for Boolean games
• Logics in Artificial Intelligence
• Manipulating games by sharing information
• Message delay and DisCSP search algorithms
• Simple search methods for finding a Nash equilibrium
• The Price of Stability for Network Design with Fair Cost Allocation
• Weighted Boolean formula games

Cited in

(5)

• Hard and soft preparation sets in Boolean games
• Incentive engineering for Boolean games
• The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
• Incentive-based search for efficient equilibria of the public goods game
• Behavioural strategies in weighted Boolean games

Describes a project that uses

Uses Software

• CP-nets

This page was built for publication: Incentive-based search for equilibria in Boolean games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009196)