Cover Image

Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brice, Léonard, Raskin, Jean-François, Sassolas, Mathieu, Scerri, Guillaume, Bogaard, Marie van den
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Computational Complexity Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Subgame-perfect Equilibria in Mean-payoff Games (journal version)
by: Brice, Léonard, et al.
Published: (2022)

The Non-Cooperative Rational Synthesis Problem for Subgame Perfect Equilibria and omega-regular Objectives
by: Bruyère, Véronique, et al.
Published: (2024)

Safety Analysis in the NGAC Model
by: Tan, Brian, et al.
Published: (2025)

As Soon as Possible but Rationally
by: Bruyère, Véronique, et al.
Published: (2024)

Reachability of Fair Allocations via Sequential Exchanges
by: Igarashi, Ayumi, et al.
Published: (2023)

Persuading a Credible Agent
by: Gan, Jiarui, et al.
Published: (2024)

Envy-Free Cake-Cutting for Four Agents
by: Hollender, Alexandros, et al.
Published: (2023)

Game-Theoretically Secure Distributed Protocols for Fair Allocation in Coalitional Games
by: Chan, T-H. Hubert, et al.
Published: (2024)

Fair Interventions in Weighted Congestion Games
by: Fischer, Miriam, et al.
Published: (2023)

Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework
by: Luberisse, Joshua
Published: (2025)

Fair Coordination in Strategic Scheduling
by: Lee, Wei-Chen, et al.
Published: (2025)

Hollow Victory: How Malicious Proposers Exploit Validator Incentives in Optimistic Rollup Dispute Games
by: Lee, Suhyeon
Published: (2025)

Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
by: Hanaka, Tesshu, et al.
Published: (2026)

Guarding Against Malicious Biased Threats (GAMBiT): Experimental Design of Cognitive Sensors and Triggers with Behavioral Impact Analysis
by: Beltz, Brandon, et al.
Published: (2025)

On the Smoothed Complexity of Combinatorial Local Search
by: Giannakopoulos, Yiannis, et al.
Published: (2022)

How to Resolve Envy by Adding Goods
by: Bentert, Matthias, et al.
Published: (2025)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
by: Lin, Chuang-Chieh, et al.
Published: (2023)

Constant Inapproximability for Fisher Markets
by: Deligkas, Argyrios, et al.
Published: (2026)

Smoothed analysis of deterministic discounted and mean-payoff games
by: Loff, Bruno, et al.
Published: (2024)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
by: Hansen, Kristoffer Arnsfelt, et al.
Published: (2025)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
by: D'Amico-Wong, Luca, et al.
Published: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
by: Zhou, Aizhong, et al.
Published: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
by: Gao, Ruiquan, et al.
Published: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
by: Brânzei, Simina, et al.
Published: (2024)

Committee Elections with Candidate Attribute Constraints
by: Zhou, Aizhong, et al.
Published: (2024)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
by: Horn, Laryssa, et al.
Published: (2025)

Modelling Network Resilience: The Complexity of Some Graph Division Games
by: Gutowski, Grzegorz, et al.
Published: (2026)

Bribery's Influence on Ranked Aggregation
by: Jain, Pallavi, et al.
Published: (2026)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Constant Inapproximability for PPA
by: Deligkas, Argyrios, et al.
Published: (2022)

Spatial Voting with Incomplete Voter Information
by: Imber, Aviram, et al.
Published: (2023)

Efficiently Computing Equilibria in Budget-Aggregation Games
by: Becker, Patrick, et al.
Published: (2025)

On the Complexity of Learning Nash Equilibria
by: Biggar, Oliver, et al.
Published: (2026)

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
by: Babichenko, Yakov, et al.
Published: (2015)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
by: Bredereck, Robert, et al.
Published: (2024)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
by: Deligkas, Argyrios, et al.
Published: (2026)

Reforming an Unfair Allocation by Exchanging Goods
by: Yuen, Sheung Man, et al.
Published: (2024)

On the Computation of Equilibria in Discrete First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2024)

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
by: Kaczmarek, Joanna, et al.
Published: (2024)