Imagen de Portada

Matrix Rationalization via Partial Orders

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Totschnig, Agnes, Vasishta, Rohit, Vetta, Adrian
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Popular Dimension of Matchings
por: Connor, Frank, et al.
Publicado: (2025)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
por: Mauras, Simon, et al.
Publicado: (2025)

Six Candidates Suffice to Win a Voter Majority
por: Charikar, Moses, et al.
Publicado: (2024)

Testing popularity in linear time via maximum matching
por: Bérczi-Kovács, Erika, et al.
Publicado: (2023)

Welfare Loss in Connected Resource Allocation
por: Bei, Xiaohui, et al.
Publicado: (2024)

Static Nuel Games with Terminal Payoff
por: Mastrakoulis, S., et al.
Publicado: (2024)

Popularity and Perfectness in One-sided Matching Markets with Capacities
por: Csáji, Gergely
Publicado: (2024)

An Algorithm for the Assignment Game Beyond Additive Valuations
por: Balkanski, Eric, et al.
Publicado: (2024)

Discrete Single-Parameter Optimal Auction Design
por: Giannakopoulos, Yiannis, et al.
Publicado: (2024)

Combinatorics on Social Configurations
por: Mermoud, Dylan Laplace, et al.
Publicado: (2024)

Tight Lower Bound for Multicolor Discrepancy
por: Manurangsi, Pasin, et al.
Publicado: (2025)

Nonatomic Non-Cooperative Neighbourhood Balancing Games
por: Auger, David, et al.
Publicado: (2023)

Misère Greedy Nim and Misère Bounded Greedy Nim
por: Omiya, Nanako, et al.
Publicado: (2025)

Discrepancy And Fair Division For Non-Additive Valuations
por: la Tour, Max Dupre, et al.
Publicado: (2025)

Tracking Truth with Liquid Democracy
por: Berinsky, Adam, et al.
Publicado: (2021)

Approximate Envy-Freeness in Graphical Cake Cutting
por: Yuen, Sheung Man, et al.
Publicado: (2023)

Computation of Approximately Stable Committees in Approval-based Elections
por: Gao, Drew, et al.
Publicado: (2025)

Improved lower bounds for the maximum size of Condorcet domains
por: Karpov, Alexander, et al.
Publicado: (2026)

Dividing a Graphical Cake
por: Bei, Xiaohui, et al.
Publicado: (2019)

Unbalanced Random Matching Markets with Partial Preferences
por: Potukuchi, Aditya, et al.
Publicado: (2024)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
por: Takazawa, Kenjiro
Publicado: (2024)

Poset Positional Games
por: Bagan, Guillaume, et al.
Publicado: (2024)

Quantifying Core Stability Relaxations in Hedonic Games
por: Demeulemeester, Tom, et al.
Publicado: (2024)

Matroids are Equitable
por: Akrami, Hannaneh, et al.
Publicado: (2025)

Asynchronous Majority Dynamics on Binomial Random Graphs
por: Mohan, Divyarthi, et al.
Publicado: (2023)

Asymptotic Analysis of Weighted Fair Division
por: Manurangsi, Pasin, et al.
Publicado: (2025)

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
por: Kanaya, Yuga, et al.
Publicado: (2025)

Fair Allocation of Indivisible Goods with Variable Groups
por: Gölz, Paul, et al.
Publicado: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
por: Hollender, Alexandros, et al.
Publicado: (2025)

Online Budgeted Matching with General Bids
por: Yang, Jianyi, et al.
Publicado: (2024)

On the Formation of Steady Coalitions
por: Mermoud, Dylan Laplace
Publicado: (2024)

Pushing the Frontier on Approximate EFX Allocations
por: Amanatidis, Georgios, et al.
Publicado: (2024)

Localizing Preference Aggregation Conflicts: A Graph-Theoretic Approach Using Sheaves
por: Sargsyan, Karen
Publicado: (2025)

On the Nucleolus of a Class of Linear Production Games
por: Baïou, Mourad, et al.
Publicado: (2022)

Liberata -- Graph Scientometrics for a Share Based System of Academic Publishing
por: Zhang, Han, et al.
Publicado: (2026)

Polynomial-Time Algorithms for Fair Orientations of Chores
por: Hsu, Kevin, et al.
Publicado: (2025)

Thinned Quantile Shares are Universally Feasible
por: Jain, Vishesh, et al.
Publicado: (2026)

A two-player version of the assignment problem
por: Galliot, Florian, et al.
Publicado: (2026)

On the Weighted Top-Difference Distance: Axioms, Aggregation, and Approximation
por: Aveni, Andrea, et al.
Publicado: (2024)

Monotone Randomized Apportionment
por: Correa, José, et al.
Publicado: (2024)