Cover Image

Symmetric Splendor: Unraveling Universally Closest Refinements and Fisher Market Equilibrium through Density-Friendly Decomposition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chan, T-H. Hubert, Xue, Quan
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Density Decomposition in Dual-Modular Optimization: Markets, Fairness, and Contracts
by: Chan, T-H. Hubert, et al.
Published: (2025)

Pricing Filtering in Dantzig-Wolfe Decomposition
by: Mehamdi, Abdellah Bulaich, et al.
Published: (2024)

Automated Symmetric Constructions in Discrete Geometry
by: Subercaseaux, Bernardo, et al.
Published: (2025)

An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
by: Sinha, Antika, et al.
Published: (2024)

Product Structure and Tree-Decompositions
by: Liu, Chun-Hung, et al.
Published: (2024)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
by: Dvořák, Pavel, et al.
Published: (2023)

Optimal Trading of a Charging-Station Company in Auction Markets for Electricity
by: Sohrabi, Farnaz, et al.
Published: (2025)

Optimal Tree-Decompositions with Bags of Bounded Treewidth
by: Hendrey, Kevin, et al.
Published: (2025)

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
by: Brucker, Francois, et al.
Published: (2024)

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
by: Kawamura, Akitoshi, et al.
Published: (2025)

Characterization of Word-Representable Graphs using Modular Decomposition
by: Dwary, Tithi, et al.
Published: (2024)

An Integer Linear Program for Periodic Scheduling in Universities
by: Moradi, Sina
Published: (2024)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
by: Bafna, Mehul, et al.
Published: (2025)

Achievable Burning Densities of Growing Grids
by: Barrett, Jordan, et al.
Published: (2026)

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)

Decomposition and factorisation of transients in Functional Graphs
by: Doré, François, et al.
Published: (2022)

Refining Boolean models with the partial most permissive scheme
by: Boina, Nadine Ben, et al.
Published: (2024)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
by: Büngener, Aaron
Published: (2025)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
by: Besançon, Mathieu
Published: (2025)

A Unified Approach to Minimizing Symmetric Submodular Functions
by: Iwata, Satoru, et al.
Published: (2026)

On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
by: Pluska, Alexander, et al.
Published: (2025)

Lower Bounds for Induced-Universal Graphs
by: Gavoille, Cyril, et al.
Published: (2025)

A Systematic Study of Single-Anchor Logical Gadgets
by: Güngör, Fikret H.
Published: (2025)

MILP-StuDio: MILP Instance Generation via Block Structure Decomposition
by: Liu, Haoyang, et al.
Published: (2024)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
by: Li, Zongji, et al.
Published: (2023)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

Making Graphs Irregular through Irregularising Walks
by: Bensmail, Julien, et al.
Published: (2025)

Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)

Generalized Spectral Decomposition for Quantum Impurity Problems
by: Wang, Jun-Bin, et al.
Published: (2024)

Soft happy colourings and community structure of networks
by: Shekarriz, Mohammad H., et al.
Published: (2024)

Diameter Bounds for Friends-and-Strangers Graphs
by: Akella, Amogh, et al.
Published: (2025)

A Weight Function Lemma Heuristic for Graph Pebbling
by: Bridi, G. A., et al.
Published: (2025)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
by: Bentert, Matthias, et al.
Published: (2026)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
by: Marx, Dániel, et al.
Published: (2026)

The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
by: Krekelberg, Bob, et al.
Published: (2025)

Transducing Linear Decompositions of Tournaments
by: Geniet, Colin, et al.
Published: (2026)

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
by: Dreier, Jan
Published: (2021)

Optimal and Efficient Partite Decompositions of Hypergraphs
by: Krapivin, Andrew, et al.
Published: (2025)