scientific article; zbMATH DE number 7730629

DOI10.4230/LIPICS.CONCUR.2021.27arXiv2102.08925MaRDI QIDQ6134271FDOQ6134271

Authors: Véronique Bruyère, Jean-François Raskin, Clément Tamines 

Publication date: 21 August 2023

Full work available at URL: https://arxiv.org/abs/2102.08925

Title of this publication is not available (Why is that?)

Recommendations

• Pareto Optimality
• scientific article; zbMATH DE number 1210013
• A foundation for Pareto aggregation
• Pareto efficiency and weighted majority rules
• Pareto-optimality of compromise decisions
• Pareto optimality and Walrasian equilibria
• Goal programming and Pareto efficiency
• Pareto optimal allocations and dynamic programming
• Pareto utility
• scientific article; zbMATH DE number 1069804

zbMATH Keywords

synthesisparity objectivesStackelberg non-zero sum games played on graphs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• A game-theoretic approach for the synthesis of complex systems
• From Spot 2.0 to Spot 2.10: What’s New?
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• Stackelberg-Pareto synthesis
• Title not available (Why is that?)

This page was built for publication:

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