Matroids are Equitable
Fuente:
arXiv
Guardado en:
| Autores principales: | Akrami, Hannaneh, Liu, Siyue, Raj, Roshan, Végh, László A. |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On complete classes of valuated matroids
por: Husić, Edin, et al.
Publicado: (2021)
por: Husić, Edin, et al.
Publicado: (2021)
On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
por: Kanaya, Yuga, et al.
Publicado: (2025)
por: Kanaya, Yuga, et al.
Publicado: (2025)
A Direct Proof of the Short-Side Advantage in Random Matching Markets
por: Mauras, Simon, et al.
Publicado: (2025)
por: Mauras, Simon, et al.
Publicado: (2025)
Discrepancy Beyond Additive Functions with Applications to Fair Division
por: Hollender, Alexandros, et al.
Publicado: (2025)
por: Hollender, Alexandros, et al.
Publicado: (2025)
Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
por: Takazawa, Kenjiro
Publicado: (2024)
por: Takazawa, Kenjiro
Publicado: (2024)
Asynchronous Majority Dynamics on Binomial Random Graphs
por: Mohan, Divyarthi, et al.
Publicado: (2023)
por: Mohan, Divyarthi, et al.
Publicado: (2023)
Poset Positional Games
por: Bagan, Guillaume, et al.
Publicado: (2024)
por: Bagan, Guillaume, et al.
Publicado: (2024)
Quantifying Core Stability Relaxations in Hedonic Games
por: Demeulemeester, Tom, et al.
Publicado: (2024)
por: Demeulemeester, Tom, et al.
Publicado: (2024)
Thinned Quantile Shares are Universally Feasible
por: Jain, Vishesh, et al.
Publicado: (2026)
por: Jain, Vishesh, et al.
Publicado: (2026)
A two-player version of the assignment problem
por: Galliot, Florian, et al.
Publicado: (2026)
por: Galliot, Florian, et al.
Publicado: (2026)
Winning in the Limit: Average-Case Committee Selection with Many Candidates
por: Lin, Yifan, et al.
Publicado: (2026)
por: Lin, Yifan, et al.
Publicado: (2026)
The Popular Dimension of Matchings
por: Connor, Frank, et al.
Publicado: (2025)
por: Connor, Frank, et al.
Publicado: (2025)
Approximately Dominating Sets in Elections
por: Charikar, Moses, et al.
Publicado: (2025)
por: Charikar, Moses, et al.
Publicado: (2025)
Six Candidates Suffice to Win a Voter Majority
por: Charikar, Moses, et al.
Publicado: (2024)
por: Charikar, Moses, et al.
Publicado: (2024)
A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
por: Takazawa, Kenjiro
Publicado: (2024)
por: Takazawa, Kenjiro
Publicado: (2024)
Stationary Online Contention Resolution Schemes
por: Aminian, Mohammad Reza, et al.
Publicado: (2026)
por: Aminian, Mohammad Reza, et al.
Publicado: (2026)
Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
por: Bilò, Vittorio, et al.
Publicado: (2025)
por: Bilò, Vittorio, et al.
Publicado: (2025)
Combinatorial Bernoulli Factories
por: Niazadeh, Rad, et al.
Publicado: (2020)
por: Niazadeh, Rad, et al.
Publicado: (2020)
Tight Lower Bound for Multicolor Discrepancy
por: Manurangsi, Pasin, et al.
Publicado: (2025)
por: Manurangsi, Pasin, et al.
Publicado: (2025)
Misère Greedy Nim and Misère Bounded Greedy Nim
por: Omiya, Nanako, et al.
Publicado: (2025)
por: Omiya, Nanako, et al.
Publicado: (2025)
Discrepancy And Fair Division For Non-Additive Valuations
por: la Tour, Max Dupre, et al.
Publicado: (2025)
por: la Tour, Max Dupre, et al.
Publicado: (2025)
Computation of Approximately Stable Committees in Approval-based Elections
por: Gao, Drew, et al.
Publicado: (2025)
por: Gao, Drew, et al.
Publicado: (2025)
Welfare Loss in Connected Resource Allocation
por: Bei, Xiaohui, et al.
Publicado: (2024)
por: Bei, Xiaohui, et al.
Publicado: (2024)
Static Nuel Games with Terminal Payoff
por: Mastrakoulis, S., et al.
Publicado: (2024)
por: Mastrakoulis, S., et al.
Publicado: (2024)
Nonatomic Non-Cooperative Neighbourhood Balancing Games
por: Auger, David, et al.
Publicado: (2023)
por: Auger, David, et al.
Publicado: (2023)
Popularity and Perfectness in One-sided Matching Markets with Capacities
por: Csáji, Gergely
Publicado: (2024)
por: Csáji, Gergely
Publicado: (2024)
Tracking Truth with Liquid Democracy
por: Berinsky, Adam, et al.
Publicado: (2021)
por: Berinsky, Adam, et al.
Publicado: (2021)
Approximate Envy-Freeness in Graphical Cake Cutting
por: Yuen, Sheung Man, et al.
Publicado: (2023)
por: Yuen, Sheung Man, et al.
Publicado: (2023)
An Algorithm for the Assignment Game Beyond Additive Valuations
por: Balkanski, Eric, et al.
Publicado: (2024)
por: Balkanski, Eric, et al.
Publicado: (2024)
Testing popularity in linear time via maximum matching
por: Bérczi-Kovács, Erika, et al.
Publicado: (2023)
por: Bérczi-Kovács, Erika, et al.
Publicado: (2023)
Improved lower bounds for the maximum size of Condorcet domains
por: Karpov, Alexander, et al.
Publicado: (2026)
por: Karpov, Alexander, et al.
Publicado: (2026)
Dividing a Graphical Cake
por: Bei, Xiaohui, et al.
Publicado: (2019)
por: Bei, Xiaohui, et al.
Publicado: (2019)
Discrete Single-Parameter Optimal Auction Design
por: Giannakopoulos, Yiannis, et al.
Publicado: (2024)
por: Giannakopoulos, Yiannis, et al.
Publicado: (2024)
Matrix Rationalization via Partial Orders
por: Totschnig, Agnes, et al.
Publicado: (2024)
por: Totschnig, Agnes, et al.
Publicado: (2024)
Combinatorics on Social Configurations
por: Mermoud, Dylan Laplace, et al.
Publicado: (2024)
por: Mermoud, Dylan Laplace, et al.
Publicado: (2024)
Asymptotic Analysis of Weighted Fair Division
por: Manurangsi, Pasin, et al.
Publicado: (2025)
por: Manurangsi, Pasin, et al.
Publicado: (2025)
Fair Allocation of Indivisible Goods with Variable Groups
por: Gölz, Paul, et al.
Publicado: (2025)
por: Gölz, Paul, et al.
Publicado: (2025)
Matroid products via submodular coupling
por: Bérczi, Kristóf, et al.
Publicado: (2024)
por: Bérczi, Kristóf, et al.
Publicado: (2024)
On the Congruency-Constrained Matroid Base
por: Liu, Siyue, et al.
Publicado: (2023)
por: Liu, Siyue, et al.
Publicado: (2023)
Localizing Preference Aggregation Conflicts: A Graph-Theoretic Approach Using Sheaves
por: Sargsyan, Karen
Publicado: (2025)
por: Sargsyan, Karen
Publicado: (2025)
Ejemplares similares
-
On complete classes of valuated matroids
por: Husić, Edin, et al.
Publicado: (2021) -
On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
por: Kanaya, Yuga, et al.
Publicado: (2025) -
A Direct Proof of the Short-Side Advantage in Random Matching Markets
por: Mauras, Simon, et al.
Publicado: (2025) -
Discrepancy Beyond Additive Functions with Applications to Fair Division
por: Hollender, Alexandros, et al.
Publicado: (2025) -
Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
por: Takazawa, Kenjiro
Publicado: (2024)