Formal verification of bayesian mechanisms
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) …
through strategic reasoning. We rely on the framework of Probabilistic Strategy Logic (PSL) …
Strategic abilities of forgetful agents in stochastic environments
In this paper, we investigate the probabilistic variants of the strategy logics ATL and ATL*
under imperfect information. Specifically, we present novel decidability and complexity …
under imperfect information. Specifically, we present novel decidability and complexity …
Bidding graph games with partially-observable budgets
Two-player zero-sum" graph games" are central in logic, verification, and multi-agent
systems. The game proceeds by placing a token on a vertex of a graph, and allowing the …
systems. The game proceeds by placing a token on a vertex of a graph, and allowing the …
Incentive design for rational agents
Abstract We introduce Incentive Design: a new class of problems for equilibrium verification
in multi-agent systems. In our model, agents attempt to maximize their utility functions, which …
in multi-agent systems. In our model, agents attempt to maximize their utility functions, which …
Rational verification with quantitative probabilistic goals
D Hyland, K Shankaranarayanan… - International …, 2024 - research.monash.edu
We study the rational verification problem for multi-agent systems in a setting where agents
have quantitative probabilistic goals. We use concurrent stochastic games to model multi …
have quantitative probabilistic goals. We use concurrent stochastic games to model multi …
Incentive Engineering for Concurrent Games
We consider the problem of incentivising desirable behaviours in multi-agent systems by
way of taxation schemes. Our study employs the concurrent games model: in this model …
way of taxation schemes. Our study employs the concurrent games model: in this model …
Socially optimal non-discriminatory restrictions for continuous-action games
M Oesterle, G Sharon - Proceedings of the AAAI Conference on …, 2023 - ojs.aaai.org
We address the following mechanism design problem: Given a multi-player Normal-Form
Game (NFG) with a continuous action space, find a non-discriminatory (ie, identical for all …
Game (NFG) with a continuous action space, find a non-discriminatory (ie, identical for all …
Representing and reasoning about auctions
The goal of this paper is to propose a framework for representing and reasoning about the
rules of auction-based protocols. Such a framework is of interest for building digital …
rules of auction-based protocols. Such a framework is of interest for building digital …
[PDF][PDF] Multi-Agent Parking Problem with Sequential Allocation.
In this paper, we study the multi-agent parking problem with time constraints adopting a
game-theoretic perspective. Precisely, cars are modeled as agents interacting among …
game-theoretic perspective. Precisely, cars are modeled as agents interacting among …
[HTML][HTML] Formal verification and synthesis of mechanisms for social choice
Mechanism Design (MD) aims at defining resources allocation protocols that satisfy a
predefined set of properties, and Auction Mechanisms are of foremost importance. Core …
predefined set of properties, and Auction Mechanisms are of foremost importance. Core …