In this paper, for the first time, we study the formal verification of Bayesian mechanisms through strategic reasoning. We rely on the framework of Probabilistic Strategy Logic (PSL), which is well-suited for representing and verifying multi-agent systems with incomplete information. We take advantage of the recent results on the decidability of PSL model checking under memoryless strategies, and reduce the problem of formally verifying Bayesian mechanisms to PSL model checking. We show how to encode Bayesian-Nash equilibrium and economical properties, and illustrate our approach with different kinds of mechanisms
Game-theoretic concepts have been extensively studied in economics to provide insight into competiti...
In the design of complex systems, model-checking and satisfiability arise as two prominent decision ...
Game-theoretic concepts have been extensively studied in economics to provide insight into competiti...
We introduce Probabilistic Strategy Logic, an extension of Strategy Logic for stochastic systems. T...
Rational verification is the problem of determining which temporal logic properties will hold in a m...
Mechanism Design aims at defining mechanisms that satisfy a predefined set of properties, and Auctio...
Model checking multi-agent systems, in which agents are distributed and thus may have different obse...
We introduce Strategy Logic with Knowledge, a novel formalism to reason about knowledge and strategi...
The design and control of autonomous systems that operate in uncertain or adversarial environments c...
The ability of reasoning about knowledge and strategy is key to the autonomy of an intelligent syste...
Abstract: In open system verification, to formally check for reliability, one needs an appropriate f...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Theoretical thesis.Bibliography: pages 119-128.1. Introduction -- 2. Game theory and modal logic -- ...
Abstract. Probabilistic model checking is an automated technique to verify whether a probabilistic s...
Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not...
Game-theoretic concepts have been extensively studied in economics to provide insight into competiti...
In the design of complex systems, model-checking and satisfiability arise as two prominent decision ...
Game-theoretic concepts have been extensively studied in economics to provide insight into competiti...
We introduce Probabilistic Strategy Logic, an extension of Strategy Logic for stochastic systems. T...
Rational verification is the problem of determining which temporal logic properties will hold in a m...
Mechanism Design aims at defining mechanisms that satisfy a predefined set of properties, and Auctio...
Model checking multi-agent systems, in which agents are distributed and thus may have different obse...
We introduce Strategy Logic with Knowledge, a novel formalism to reason about knowledge and strategi...
The design and control of autonomous systems that operate in uncertain or adversarial environments c...
The ability of reasoning about knowledge and strategy is key to the autonomy of an intelligent syste...
Abstract: In open system verification, to formally check for reliability, one needs an appropriate f...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Theoretical thesis.Bibliography: pages 119-128.1. Introduction -- 2. Game theory and modal logic -- ...
Abstract. Probabilistic model checking is an automated technique to verify whether a probabilistic s...
Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not...
Game-theoretic concepts have been extensively studied in economics to provide insight into competiti...
In the design of complex systems, model-checking and satisfiability arise as two prominent decision ...
Game-theoretic concepts have been extensively studied in economics to provide insight into competiti...