:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Heckett, Alexander, Conitzer, Vincent
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory F.2
Online Access:	https://arxiv.org/abs/2511.23454
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Optimal Equilibria in Repeated Games with Restarts
by: Berker, Ratip Emin, et al.
Published: (2024)

Designing Rules to Pick a Rule: Aggregation by Consistency
by: Berker, Ratip Emin, et al.
Published: (2025)

Choosing What Game to Play without Selecting Equilibria: Inferring Safe (Pareto) Improvements in Binary Constraint Structures
by: Oesterheld, Caspar, et al.
Published: (2025)

The Complexity of Computing Robust Mediated Equilibria in Ordinal Games
by: Conitzer, Vincent
Published: (2024)

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

Game Theory with Simulation of Other Players
by: Kovarik, Vojtech, et al.
Published: (2023)

On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
by: Berker, Ratip Emin, et al.
Published: (2025)

Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule
by: Babashah, Negar, et al.
Published: (2024)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
by: Cheval, Vincent, et al.
Published: (2025)

Maximizing Social Welfare with Side Payments
by: Geffner, Ivan, et al.
Published: (2025)

Can CDT rationalise the ex ante optimal policy via modified anthropics?
by: Cooper, Emery, et al.
Published: (2024)

Recursive Joint Simulation in Games
by: Kovarik, Vojtech, et al.
Published: (2024)

Aggregating Quantitative Relative Judgments: From Social Choice to Ranking Prediction
by: Xu, Yixuan Even, et al.
Published: (2024)

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

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

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)

An Interpretable Automated Mechanism Design Framework with Large Language Models
by: Liu, Jiayuan, et al.
Published: (2025)

Game Theory with Simulation in the Presence of Unpredictable Randomisation
by: Kovarik, Vojtech, et al.
Published: (2024)

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

Characterising Simulation-Based Program Equilibria
by: Cooper, Emery, et al.
Published: (2024)

Complexity of Unambiguous Problems in $Σ^P_2$
by: Gilboa, Matan, et al.
Published: (2025)

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

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)

Single-Winner Voting on Matchings
by: Boehmer, Niclas, et al.
Published: (2026)

Steering No-Regret Learners to a Desired Equilibrium
by: Zhang, Brian Hu, et al.
Published: (2023)

From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
by: Berker, Ratip Emin, et al.
Published: (2025)

Adjusted Winner: from Splitting to Selling
by: Bredereck, Robert, et al.
Published: (2026)

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

Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models
by: Panageas, Ioannis, et al.
Published: (2021)

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

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

What Voting Rules Actually Do: A Data-Driven Analysis of Multi-Winner Voting
by: Caiata, Joshua, et al.
Published: (2025)

Simple Stochastic Stopping Games: A Generator and Benchmark Library
by: Rudich, Avi, et al.
Published: (2024)

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

AI Testing Should Account for Sophisticated Strategic Behaviour
by: Kovarik, Vojtech, et al.
Published: (2025)

Beyond Winner-Take-All Procurement Auctions
by: Garimidi, Pranav, et al.
Published: (2026)

Reactive Synthesis for Expected Impacts
by: Chini, Emanuele, et al.
Published: (2024)

Finding Possible Winners in Spatial Voting with Incomplete Information
by: Shachnai, Hadas, et al.
Published: (2025)