:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Lock, Edwin, Qiu, Zephyr, Teytelboym, Alexander
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computer Science and Game Theory Computational Complexity
Accesso online:	https://arxiv.org/abs/2402.08484
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Complexity of Stability in Trading Networks
di: Fleiner, Tamás, et al.
Pubblicazione: (2018)

Envy-Free House Allocation with Minimum Subsidy
di: Choo, Davin, et al.
Pubblicazione: (2024)

On the Smoothed Complexity of Combinatorial Local Search
di: Giannakopoulos, Yiannis, et al.
Pubblicazione: (2022)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
di: Lin, Chuang-Chieh, et al.
Pubblicazione: (2023)

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

Efficiently Computing Equilibria in Budget-Aggregation Games
di: Becker, Patrick, et al.
Pubblicazione: (2025)

Constant Inapproximability for Fisher Markets
di: Deligkas, Argyrios, et al.
Pubblicazione: (2026)

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

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
di: Deligkas, Argyrios, et al.
Pubblicazione: (2026)

Computational Social Choice: Parameterized Complexity and Challenges
di: Chen, Jiehua, et al.
Pubblicazione: (2024)

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

The Complexity of Min-Max Optimization with Product Constraints
di: Bernasconi, Martino, et al.
Pubblicazione: (2026)

On the Computation of Equilibria in Discrete First-Price Auctions
di: Filos-Ratsikas, Aris, et al.
Pubblicazione: (2024)

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

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
di: Aziz, Haris, et al.
Pubblicazione: (2024)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
di: Hansen, Kristoffer Arnsfelt, et al.
Pubblicazione: (2025)

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

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
di: Brânzei, Simina, et al.
Pubblicazione: (2024)

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

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
di: Koenemann, Jochen, et al.
Pubblicazione: (2021)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
di: Li, Zihan, et al.
Pubblicazione: (2024)

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

On Efficient Computation of DiRe Committees
di: Relia, Kunal
Pubblicazione: (2024)

Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
di: Kawase, Sota, et al.
Pubblicazione: (2024)

The Complexity of Optimizing Atomic Congestion
di: Brand, Cornelius, et al.
Pubblicazione: (2023)

Structural Complexities of Matching Mechanisms
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2022)

The Complexity of Sparse Win-Lose Bimatrix Games
di: Batziou, Eleni, et al.
Pubblicazione: (2026)

The Combinatorial Multi-Round Ascending Auction
di: Kasberger, Bernhard, et al.
Pubblicazione: (2022)

Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters
di: Colley, Rachael, et al.
Pubblicazione: (2025)

Smoothed analysis of deterministic discounted and mean-payoff games
di: Loff, Bruno, et al.
Pubblicazione: (2024)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
di: D'Amico-Wong, Luca, et al.
Pubblicazione: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
di: Zhou, Aizhong, et al.
Pubblicazione: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
di: Gao, Ruiquan, et al.
Pubblicazione: (2024)

Committee Elections with Candidate Attribute Constraints
di: Zhou, Aizhong, et al.
Pubblicazione: (2024)

Reforming an Unfair Allocation by Exchanging Goods
di: Yuen, Sheung Man, et al.
Pubblicazione: (2024)

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
di: Kaczmarek, Joanna, et al.
Pubblicazione: (2024)

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

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
di: Bernasconi, Martino, et al.
Pubblicazione: (2024)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
di: Ron, Shiri, et al.
Pubblicazione: (2024)

Persuading a Credible Agent
di: Gan, Jiarui, et al.
Pubblicazione: (2024)