Cover Image

Byzantine Game Theory: Sun Tzus Boxes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Constantinescu, Andrei, Wattenhofer, Roger
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Precomputed Dominant Resource Fairness
by: Metin, Serdar
Published: (2025)

Asynchronous Opinion Dynamics in Social Networks
by: Berenbrink, Petra, et al.
Published: (2022)

Transaction Fee Market Design for Parallel Execution
by: Acilan, Bahar, et al.
Published: (2025)

Undetectable Selfish Mining
by: Bahrani, Maryam, et al.
Published: (2023)

PureLottery: Fair and Bias-Resistant Leader Election with a Novel Single-Elimination Tournament Algorithm
by: Ballweg, Jonas
Published: (2024)

Logarithmic Approximation for Road Pricing on Grids
by: Constantinescu, Andrei, et al.
Published: (2025)

Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
by: Baharav, Carmel, et al.
Published: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)

Fully-Distributed Byzantine Agreement in Sparse Networks
by: Augustine, John, et al.
Published: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
by: Almeida, Paulo Sérgio, et al.
Published: (2024)

Efficient calculation of available space for multi-NUMA virtual machines
by: Gudkov, Andrei, et al.
Published: (2026)

Byzantine Stable Matching
by: Constantinescu, Andrei, et al.
Published: (2025)

OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
by: Chen, Jinyuan
Published: (2024)

Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)

Parallel $k$-Core Decomposition: Theory and Practice
by: Liu, Youzhe, et al.
Published: (2025)

Validity in Network-Agnostic Byzantine Agreement
by: Constantinescu, Andrei, et al.
Published: (2024)

From Few to Many Faults: Optimal Adaptive Byzantine Agreement
by: Constantinescu, Andrei, et al.
Published: (2025)

A Cut-Matching Game for Constant-Hop Expanders
by: Haeupler, Bernhard, et al.
Published: (2022)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

SNARE: A TRAP for Rational Players to Solve Byzantine Consensus in the 5f+1 Model
by: Ranchal-Pedrosa, Alejandro, et al.
Published: (2026)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)

Constrained Cuts, Flows, and Lattice-Linearity
by: Streit, Robert, et al.
Published: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)

BLEST: Blazingly Efficient BFS using Tensor Cores
by: Elbek, Deniz, et al.
Published: (2025)

Weighted Matching in a Poly-Streaming Model
by: Ullah, Ahammed, et al.
Published: (2025)

Computing in a Faulty Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
by: Dufoulon, Fabien, et al.
Published: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
by: Gil, Yuval, et al.
Published: (2025)

Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
by: Shovan, S. M., et al.
Published: (2025)