Image de couverture de livre

Near-Optimal Coalition Structures in Polynomial Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Majumdar, Angshul
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory Artificial Intelligence 91A12, 68T42, 90C27 G.1.6; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Bayesian Recovery for Probabilistic Coalition Structures
par: Majumdar, Angshul
Publié: (2025)

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
par: Perron, Cédrick, et autres
Publié: (2025)

Computational Phase Transitions in Binary Compressed Sensing: Quantum Annealing Inside the Relaxation Gap
par: Hahn, William, et autres
Publié: (2026)

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
par: Hancock, James, et autres
Publié: (2023)

Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
par: Hancock, James, et autres
Publié: (2025)

Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
par: Jin, Tao, et autres
Publié: (2025)

Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
par: Bärligea, Adelina, et autres
Publié: (2025)

Approximating Bimatrix Nash Equilibrium Via Trilinear Minimax
par: Kalantari, Bahman
Publié: (2018)

Approximation algorithms for the prize-collecting rural postman problem
par: Li, Hong, et autres
Publié: (2026)

Quantum walk informed variational algorithm design
par: Matwiejew, Edric, et autres
Publié: (2024)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
par: Ali, Alejandro Mata
Publié: (2025)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
par: Cheng, Cong-Dian
Publié: (2017)

Quasi-binary encoding based quantum alternating operator ansatz
par: Chen, Bingren, et autres
Publié: (2023)

The Power of Matching for Online Fractional Hedonic Games
par: Bullinger, Martin, et autres
Publié: (2025)

Going with the Flow: Approximating Banzhaf Values via Graph Neural Networks
par: Kempinski, Benjamin, et autres
Publié: (2025)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
par: Ryabchenko, Alexander, et autres
Publié: (2026)

Modern column generation for estimating single- and multi-purchase ranked list choice models
par: Costa, Luciano, et autres
Publié: (2026)

PRIME: Efficient Algorithm for Token Graph Routing Problem
par: Xu, Haotian, et autres
Publié: (2026)

Decision Making under Imperfect Recall: Algorithms and Benchmarks
par: Tewolde, Emanuel, et autres
Publié: (2026)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
par: Feldman, Moran, et autres
Publié: (2025)

Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems
par: Binimelis, Miquel Albertí
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
par: Warme, David M.
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
par: Warme, David M.
Publié: (2024)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
par: Fang, Xiaolei, et autres
Publié: (2026)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
par: Emmerich, Michael T. M.
Publié: (2026)

P vs NP Problem in Portfolio Optimization: Integrating the Markowitz-CAPM Framework with Cardinality Constraints and Black-Scholes Derivative Pricing
par: Gondauri, Davit
Publié: (2026)

Mutually Unbiased Bases for Variational Quantum Initialization: Basis-Union Optimality and Adaptive Family Search
par: Semre, Abed, et autres
Publié: (2026)

Polynomial-Time Algorithms for Computing the Nucleolus: An Assessment
par: Meinhardt, Holger I.
Publié: (2025)

Ethic Duality: A Homological Framework for Primal-Dual Problems
par: Pasechnyuk-Vilensky, Dmitry, et autres
Publié: (2025)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
par: Circelli, Michele
Publié: (2026)

On the Stability of Learning in Network Games with Many Players
par: Hussain, Aamal, et autres
Publié: (2024)

Discovering Algorithms with Computational Language Processing
par: Bourdais, Theo, et autres
Publié: (2025)

LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection
par: Xu, Jinyu, et autres
Publié: (2026)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
par: Emmerich, Michael T. M., et autres
Publié: (2026)

Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences
par: Manurangsi, Pasin, et autres
Publié: (2026)

Bond-dimension scaling of a local-refinement advantage over hyperoptimized tensor-network contraction on Sycamore like topologies
par: Guerrero, Rubén Darío
Publié: (2026)

Game-Theoretic Discovery of Quantum Error-Correcting Codes Through Nash Equilibria
par: Guerrero, Rubén Darío
Publié: (2025)

Maximizing Index Diversity in Committee Elections
par: Böhm, Paula, et autres
Publié: (2026)

From Non-Identifiability to Goal-Integrated Decision-Making in Parametric Inverse Optimization
par: Ahmadi, Farzin, et autres
Publié: (2026)

Fractional Budget Allocation for Influence Maximization under General Marketing Strategies
par: Bhimaraju, Akhil, et autres
Publié: (2024)