Cover Image

Maps of Tournaments: Distances, Experiments, and Data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nikolow, Filip, Faliszewski, Piotr, Szufa, Stanisław
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory 05C20 F.2.2; J.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning Real-Life Approval Elections
by: Faliszewski, Piotr, et al.
Published: (2026)

Robustness of Approval-Based Multiwinner Voting Rules
by: Faliszewski, Piotr, et al.
Published: (2026)

Selling Privacy in Blockchain Transactions
by: Chionas, Georgios, et al.
Published: (2025)

Bribery Can Get Harder in Structured Multiwinner Approval Election
by: Kusek, Bartosz, et al.
Published: (2022)

Multidimensional Budget-Feasible Mechanism Design
by: Neogi, Rian, et al.
Published: (2025)

An Experimental Comparison of Multiwinner Voting Rules on Approval Elections
by: Faliszewski, Piotr, et al.
Published: (2024)

Fair distribution of bundles
by: Soberón, Pablo
Published: (2025)

Credibility Trilemma in Polymatroidal Service Markets
by: Lovén, Lauri, et al.
Published: (2026)

Zero Carbon V2X Tariffs for Non-Domestic Customers
by: Shamash, Elisheva S, et al.
Published: (2025)

Distances Between Top-Truncated Elections of Different Sizes
by: Faliszewski, Piotr, et al.
Published: (2026)

An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
by: Neogi, Rian, et al.
Published: (2025)

A Framework for Graph-Conditioned Hierarchical Shapley Attribution in Patent Valuation
by: Bose, Joy
Published: (2026)

Proof of Useful Attestation: A Consensus Primitive for Attestation-Native Chains
by: Stefanović, Stefan
Published: (2026)

Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024)

Matroid Bayesian Online Selection
by: DeHaan, Ian, et al.
Published: (2024)

Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
by: Sun, Ankang, et al.
Published: (2024)

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
by: Li, Bo, et al.
Published: (2024)

Hierarchical Battery-Aware Game Algorithm for ISL Power Allocation in LEO Mega-Constellations
by: Sun, Kangkang, et al.
Published: (2026)

Heterogeneous Mean Field Game Framework for LEO Satellite-Assisted V2X Networks
by: Sun, Kangkang, et al.
Published: (2026)

A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching
by: Castera, Rémi, et al.
Published: (2026)

Computational Intractability of Strategizing against Online Learners
by: Assos, Angelos, et al.
Published: (2025)

Outer Diversity of Structured Domains
by: Faliszewski, Piotr, et al.
Published: (2026)

Diversity of Structured Domains via k-Kemeny Scores
by: Faliszewski, Piotr, et al.
Published: (2025)

An Equilibrium Analysis of the Arad-Rubinstein Game
by: Ewerhart, Christian, et al.
Published: (2024)

How Similar Are Two Elections?
by: Faliszewski, Piotr, et al.
Published: (2026)

Map of Elections
by: Szufa, Stanisław
Published: (2024)

The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
by: Pulyassary, Haripriya, et al.
Published: (2025)

Temporal Fair Division in Multi-Agent Systems: From Precise Alternation Metrics to Scalable Coordination Proxies
by: Papadopoulos, Nikolaos Al.
Published: (2026)

On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
by: De, Koustav
Published: (2025)

MEV Sharing with Dynamic Extraction Rates
by: Braga, Pedro, et al.
Published: (2024)

Strategic Cost Selection in Participatory Budgeting
by: Faliszewski, Piotr, et al.
Published: (2024)

Agreement, Diversity, and Polarization Indices for Approval Elections
by: Faliszewski, Piotr, et al.
Published: (2026)

Path Extendable Tournaments
by: Zhang, Zan-Bo, et al.
Published: (2025)

Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs
by: Csáji, Gergely, et al.
Published: (2026)

A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
by: Akrami, Hannaneh, et al.
Published: (2026)

On MMS, APS and XOS
by: Feige, Uriel, et al.
Published: (2026)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
by: Bredereck, Robert, et al.
Published: (2020)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
by: Livanos, Vasilis, et al.
Published: (2024)

Fair allocations with subadditive and XOS valuations
by: Feige, Uriel, et al.
Published: (2025)