Imagen de Portada

A Characterization of Complexity in Public Goods Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Gilboa, Matan
Formato:	Preprint
Publicado:	2023
Materias:	Computer Science and Game Theory 91A68 (Primary), 68Q17 (Secondary) F.2.0
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
por: Ito, Shinji, et al.
Publicado: (2026)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
por: Ito, Shinji, et al.
Publicado: (2025)

Two-player Domino games
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2023)

Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
por: Tewolde, Emanuel, et al.
Publicado: (2024)

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
por: Bhaskar, Umang, et al.
Publicado: (2024)

Equilibrium Computation in the Hotelling-Downs Model of Spatial Competition
por: Bhaskar, Umang, et al.
Publicado: (2024)

The Value of Recall in Extensive-Form Games
por: Berker, Ratip Emin, et al.
Publicado: (2024)

The Computational Complexity of Variational Inequalities and Applications in Game Theory
por: Kapron, Bruce M., et al.
Publicado: (2024)

Low communication protocols for fair allocation of indivisible goods
por: Feige, Uriel
Publicado: (2024)

On the equivalence of semidefinite programming and zero-sum semidefinite games
por: Elliott, Jesse, et al.
Publicado: (2026)

Computing Game Symmetries and Equilibria That Respect Them
por: Tewolde, Emanuel, et al.
Publicado: (2025)

Improved Approximation Ratio for Strategyproof Facility Location on a Cycle
por: Rogowski, Krzysztof, et al.
Publicado: (2025)

Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity
por: Caragiannis, Ioannis, et al.
Publicado: (2024)

Algorithmic Cheap Talk
por: Babichenko, Yakov, et al.
Publicado: (2023)

On Computing the Shapley Value in Bankruptcy Games -llustrated by Rectified Linear Function Game-
por: Yamazaki, Shunta, et al.
Publicado: (2025)

Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games
por: Jimbo, Takumi, et al.
Publicado: (2026)

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

Hive is PSPACE-Hard
por: Andel, Daniël, et al.
Publicado: (2025)

The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
por: Schlotter, Ildikó, et al.
Publicado: (2021)

The Exchange Problem
por: Garg, Mohit, et al.
Publicado: (2024)

Breaking $1/ε$ Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
por: Su, Yiheng, et al.
Publicado: (2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
por: Feldman, Moran, et al.
Publicado: (2025)

Markets are competitive if and only if P != NP
por: Maymin, Philip Z.
Publicado: (2026)

Fair Division in a Variable Setting
por: Chandramouleeswaran, Harish, et al.
Publicado: (2024)

Greedy Poisson Rejection Sampling
por: Flamich, Gergely
Publicado: (2023)

A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights
por: Legacci, Davide, et al.
Publicado: (2024)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
por: Dorochko, Leonid, et al.
Publicado: (2026)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
por: Ye, Lixi
Publicado: (2026)

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
por: Jaakkola, Reijo, et al.
Publicado: (2024)

The Power of Matching for Online Fractional Hedonic Games
por: Bullinger, Martin, et al.
Publicado: (2025)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
por: Bruse, Florian, et al.
Publicado: (2026)

Computational Complexity of Determining the Assembly Index
por: Masierak, Piotr
Publicado: (2026)

Paintbucket on graphs is PSPACE-complete
por: Saunders, Ethan J., et al.
Publicado: (2024)

Serious Games: Human-AI Interaction, Evolution, and Coevolution
por: Doreswamy, Nandini, et al.
Publicado: (2025)

Robust equilibria in continuous games: From strategic to dynamic robustness
por: Lotidis, Kyriakos, et al.
Publicado: (2025)

Accelerated regularized learning in finite N-person games
por: Lotidis, Kyriakos, et al.
Publicado: (2024)

Complete Game Logic with Sabotage
por: Wafa, Noah Abou El, et al.
Publicado: (2024)

Grothendieck Topologies and Sheaf-Theoretic Foundations of Cryptographic Security: Attacker Models and $Σ$-Protocols as the First Step
por: Inoué, Takao
Publicado: (2026)

Strategyproof Maximum Matching under Dichotomous Agent Preferences
por: Aziz, Haris, et al.
Publicado: (2025)

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