Cover Image

New allocation rule based on graph structures and their application to economic phenomena

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yamada, Taiki, Matsubae, Taisuke, Akamatsu, Tomoya
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Discrete Mathematics Primary 68R10, Secondary 90B06
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)

A greedy heuristic for graph burning
by: García-Díaz, Jesús, et al.
Published: (2024)

Obstructions to return preservation for episturmian morphisms
by: Berthé, Valérie, et al.
Published: (2024)

Revisiting Sparse Matrix Coloring and Bicoloring
by: Montoison, Alexis, et al.
Published: (2025)

Symmetric properties and two variants of shuffle-cubes
by: Lü, Huazhong, et al.
Published: (2021)

A note on the structure of locally finite planar quasi-transitive graphs
by: Giocanti, Ugo
Published: (2024)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
by: Meusel, Julia, et al.
Published: (2025)

New Vertex Ordering Characterizations of Circular-Arc Bigraphs
by: Paul, Indrajit, et al.
Published: (2025)

Grid-drawings of graphs in three-dimensions
by: Balogh, Jozsef, et al.
Published: (2024)

Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)

Cops and Robbers on Multi-Layer Graphs
by: Enright, Jessica, et al.
Published: (2023)

Reducing Dominating Sets in Graphs
by: Inza, Ernesto Parra, et al.
Published: (2024)

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
by: S, Rajeshwari, et al.
Published: (2022)

Stability properties for subgroups generated by return words
by: Gheeraert, France, et al.
Published: (2024)

Concurrency Constrained Scheduling with Tree-Like Constraints
by: Bodlaender, Hans L., et al.
Published: (2025)

Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)

SAT-Based Search for Minwise Independent Families
by: Iurlano, Enrico, et al.
Published: (2024)

Harmonious Colorings: bounds, heuristics and integer-linear formulations
by: Araújo, Júlio, et al.
Published: (2026)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)

Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)

Bad local minima exist in the stochastic block model
by: Coja-Oghlan, Amin, et al.
Published: (2024)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

The Hierarchy of Hereditary Sorting Operators
by: Jelínek, Vít, et al.
Published: (2023)

Implied Integrality in Mixed-Integer Optimization
by: van der Hulst, Rolf, et al.
Published: (2025)

From data to concepts via wiring diagrams
by: Lo, Jason, et al.
Published: (2025)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Totally equimodular matrices: decomposition and triangulation
by: Chervet, Patrick, et al.
Published: (2025)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

Linear extensions of finite posets
by: Chan, Swee Hong, et al.
Published: (2023)

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

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

The damage number of the Cartesian product of graphs
by: Huggan, Melissa A., et al.
Published: (2023)

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
by: Hliněný, Petr
Published: (2023)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
by: Hliněný, Petr, et al.
Published: (2024)

Paired many-to-many 2-disjoint path cover of Johnson graphs
by: Liu, Jinhao, et al.
Published: (2025)

Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
by: Chiarelli, Nina, et al.
Published: (2024)