Copertina

Computing a Fixed Point of Contraction Maps in Polynomial Queries

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Xi, Li, Yuhao, Yannakakis, Mihalis
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity Data Structures and Algorithms Computer Science and Game Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Quadratic Speedup for Computing Contraction Fixed Points
di: Chen, Xi, et al.
Pubblicazione: (2026)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
di: Chen, Xi, et al.
Pubblicazione: (2026)

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

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

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

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
di: Benedek, Márton, et al.
Pubblicazione: (2023)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
di: Hanaka, Tesshu, et al.
Pubblicazione: (2024)

EF1 and EFX Orientations
di: Deligkas, Argyrios, et al.
Pubblicazione: (2024)

Hedonic Seat Arrangement Problems
di: Bodlaender, Hans L., et al.
Pubblicazione: (2020)

The Price of Justified Representation
di: Elkind, Edith, et al.
Pubblicazione: (2021)

A Smoothed FPTAS for Equilibria in Congestion Games
di: Giannakopoulos, Yiannis
Pubblicazione: (2023)

Unravelling Expressive Delegations: Complexity and Normative Analysis
di: Tyrovolas, Giannis, et al.
Pubblicazione: (2023)

Satisfactory Budget Division
di: Gourvès, Laurent, et al.
Pubblicazione: (2025)

A Quadratic Lower Bound for Stable Roommates Solvability
di: Rosenbaum, Will
Pubblicazione: (2025)

Nemesis, an Escape Game in Graphs
di: Bergé, Pierre, et al.
Pubblicazione: (2026)

Complexity of Auctions with Interdependence
di: Loiseau, Patrick, et al.
Pubblicazione: (2026)

An Algorithm-to-Contract Framework without Demand Queries
di: Doron-Arad, Ilan, et al.
Pubblicazione: (2025)

Partitioned Matching Games for International Kidney Exchange
di: Benedek, Márton, et al.
Pubblicazione: (2023)

Min-Max Optimization Requires Exponentially Many Queries
di: Bernasconi, Martino, et al.
Pubblicazione: (2026)

Computing Tarski Fixed Points in Financial Networks
di: Besting, Leander, et al.
Pubblicazione: (2026)

Dynamic Debt Swapping in Financial Networks
di: Froese, Henri, et al.
Pubblicazione: (2023)

Attractors Is All You Need: Parity Games In Polynomial Time
di: van der Heijden, Rick
Pubblicazione: (2025)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
di: Attias, Idan, et al.
Pubblicazione: (2025)

Designing Exploration Contracts
di: Hoefer, Martin, et al.
Pubblicazione: (2024)

A Strongly Polynomial Algorithm for Arctic Auctions
di: Garg, Jugal, et al.
Pubblicazione: (2026)

On Binary Networked Public Goods Game with Altruism
di: Maiti, Arnab, et al.
Pubblicazione: (2022)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
di: Gupta, Sushmita, et al.
Pubblicazione: (2025)

How to Balance the Load Online When Jobs and Machines Are Both Selfish?
di: Wang, Wenqian, et al.
Pubblicazione: (2024)

Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
di: Bowers, Robin, et al.
Pubblicazione: (2025)

Computing Power Indices in Weighted Majority Games with Formal Power Series
di: Kakimura, Naonori, et al.
Pubblicazione: (2025)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
di: Andersen, Martin Jupakkal, et al.
Pubblicazione: (2025)

Prophet Secretary and Matching: the Significance of the Largest Item
di: Chen, Ziyun, et al.
Pubblicazione: (2024)

Maximizing social welfare among EF1 allocations at the presence of two types of agents
di: Ma, Jiaxuan, et al.
Pubblicazione: (2025)

Strategic Facility Location via Predictions
di: Chen, Qingyun, et al.
Pubblicazione: (2024)

Stochastic Online Correlated Selection
di: Chen, Ziyun, et al.
Pubblicazione: (2024)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
di: Feng, Yuda, et al.
Pubblicazione: (2024)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
di: Chen, Liyan, et al.
Pubblicazione: (2024)

Stable Matching with Interviews
di: Ashlagi, Itai, et al.
Pubblicazione: (2025)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
di: Feng, Yuda, et al.
Pubblicazione: (2024)

Online Nash Welfare Maximization Without Predictions
di: Huang, Zhiyi, et al.
Pubblicazione: (2022)