Cover Image

Efficiently Computing Equilibria in Budget-Aggregation Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Becker, Patrick, Fries, Alexander, Greger, Matthias, Segal-Halevi, Erel
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Budget Aggregation with Star-Shaped Preference Domains
by: Brandt, Felix, et al.
Published: (2024)

What Are People's Actual Utility Functions in Budget Aggregation?
by: Amster, Ayelet, et al.
Published: (2025)

Coordinating Charitable Donations with Leontief Preferences
by: Brandt, Felix, et al.
Published: (2023)

Perpetually Fair Assignments Via Balanced Sequences of Permutations
by: Adams, Terrence, et al.
Published: (2026)

Tight Inapproximability of Nash Equilibria in Public Goods Games
by: Dinh, Jérémi Do, et al.
Published: (2024)

On the Computation of Equilibria in Discrete First-Price Auctions
by: Filos-Ratsikas, Aris, 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)

Computing approximate roots of monotone functions
by: Hollender, Alexandros, et al.
Published: (2023)

Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
by: Aziz, Haris, et al.
Published: (2020)

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

Perpetual Fully-Online Approximate Fairness
by: Kahana, Ido, et al.
Published: (2026)

Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)

A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Fair Allocation of Improvements: When Old Endowments Shape New Assignments
by: Elmalem, Noga Klein, et al.
Published: (2025)

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

On Minimal Achievable Quotas in Multiwinner Voting
by: Becker, Patrick, et al.
Published: (2025)

Hardness of Approximate Hylland-Zeckhauser Equilibria
by: Braverman, Mark, et al.
Published: (2026)

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
by: Chen, Xi, et al.
Published: (2025)

Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)

Weighted Fairness Notions for Indivisible Items Revisited
by: Chakraborty, Mithun, et al.
Published: (2021)

A Smoothed FPTAS for Equilibria in Congestion Games
by: Giannakopoulos, Yiannis
Published: (2023)

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

Core Existence in Approval-Based Committee Elections with up to Five Voter Types
by: Becker, Patrick, et al.
Published: (2026)

Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
by: Li, Tongyang, et al.
Published: (2025)

Fair Allocation with Money: What is Your Objective?
by: Elmalem, Noga Klein, et al.
Published: (2025)

Robust Stackelberg Equilibria
by: Gan, Jiarui, et al.
Published: (2023)

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

The Computational Complexity of the Housing Market
by: Lock, Edwin, et al.
Published: (2024)

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

It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents
by: Hartman, Eden, et al.
Published: (2025)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)

Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)

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

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

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

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
by: Bhaduri, Purandar
Published: (2025)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
by: Rothe, Jörg, et al.
Published: (2025)

On Efficient Computation of DiRe Committees
by: Relia, Kunal
Published: (2024)

Equilibrium Computation in First-Price Auctions with Correlated Priors
by: Filos-Ratsikas, Aris, et al.
Published: (2025)