Image de couverture de livre

Liberata -- Graph Scientometrics for a Share Based System of Academic Publishing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Han, Sabath, Anshuman, Dunn, Timothy W., Brinson, L. Catherine
Format:	Preprint
Publié:	2026
Sujets:	Digital Libraries Discrete Mathematics Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
par: Kanaya, Yuga, et autres
Publié: (2025)

Thinned Quantile Shares are Universally Feasible
par: Jain, Vishesh, et autres
Publié: (2026)

Asynchronous Majority Dynamics on Binomial Random Graphs
par: Mohan, Divyarthi, et autres
Publié: (2023)

Welfare Loss in Connected Resource Allocation
par: Bei, Xiaohui, et autres
Publié: (2024)

Static Nuel Games with Terminal Payoff
par: Mastrakoulis, S., et autres
Publié: (2024)

Tight Lower Bound for Multicolor Discrepancy
par: Manurangsi, Pasin, et autres
Publié: (2025)

Nonatomic Non-Cooperative Neighbourhood Balancing Games
par: Auger, David, et autres
Publié: (2023)

Misère Greedy Nim and Misère Bounded Greedy Nim
par: Omiya, Nanako, et autres
Publié: (2025)

Discrepancy And Fair Division For Non-Additive Valuations
par: la Tour, Max Dupre, et autres
Publié: (2025)

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

Tracking Truth with Liquid Democracy
par: Berinsky, Adam, et autres
Publié: (2021)

Approximate Envy-Freeness in Graphical Cake Cutting
par: Yuen, Sheung Man, et autres
Publié: (2023)

An Algorithm for the Assignment Game Beyond Additive Valuations
par: Balkanski, Eric, et autres
Publié: (2024)

Computation of Approximately Stable Committees in Approval-based Elections
par: Gao, Drew, et autres
Publié: (2025)

Testing popularity in linear time via maximum matching
par: Bérczi-Kovács, Erika, et autres
Publié: (2023)

Improved lower bounds for the maximum size of Condorcet domains
par: Karpov, Alexander, et autres
Publié: (2026)

Dividing a Graphical Cake
par: Bei, Xiaohui, et autres
Publié: (2019)

Discrete Single-Parameter Optimal Auction Design
par: Giannakopoulos, Yiannis, et autres
Publié: (2024)

Matrix Rationalization via Partial Orders
par: Totschnig, Agnes, et autres
Publié: (2024)

Combinatorics on Social Configurations
par: Mermoud, Dylan Laplace, et autres
Publié: (2024)

Localizing Preference Aggregation Conflicts: A Graph-Theoretic Approach Using Sheaves
par: Sargsyan, Karen
Publié: (2025)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
par: Takazawa, Kenjiro
Publié: (2024)

Matroids are Equitable
par: Akrami, Hannaneh, et autres
Publié: (2025)

Asymptotic Analysis of Weighted Fair Division
par: Manurangsi, Pasin, et autres
Publié: (2025)

Poset Positional Games
par: Bagan, Guillaume, et autres
Publié: (2024)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
par: Mauras, Simon, et autres
Publié: (2025)

Quantifying Core Stability Relaxations in Hedonic Games
par: Demeulemeester, Tom, et autres
Publié: (2024)

Fair Allocation of Indivisible Goods with Variable Groups
par: Gölz, Paul, et autres
Publié: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
par: Hollender, Alexandros, et autres
Publié: (2025)

Online Budgeted Matching with General Bids
par: Yang, Jianyi, et autres
Publié: (2024)

On the Nucleolus of a Class of Linear Production Games
par: Baïou, Mourad, et autres
Publié: (2022)

On the Formation of Steady Coalitions
par: Mermoud, Dylan Laplace
Publié: (2024)

Pushing the Frontier on Approximate EFX Allocations
par: Amanatidis, Georgios, et autres
Publié: (2024)

Polynomial-Time Algorithms for Fair Orientations of Chores
par: Hsu, Kevin, et autres
Publié: (2025)

Peer Reviews of Peer Reviews: A Randomized Controlled Trial and Other Experiments
par: Goldberg, Alexander, et autres
Publié: (2023)

A two-player version of the assignment problem
par: Galliot, Florian, et autres
Publié: (2026)

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
par: Ekbatani, Farbod, et autres
Publié: (2026)

Winning in the Limit: Average-Case Committee Selection with Many Candidates
par: Lin, Yifan, et autres
Publié: (2026)

On complete classes of valuated matroids
par: Husić, Edin, et autres
Publié: (2021)

On the Weighted Top-Difference Distance: Axioms, Aggregation, and Approximation
par: Aveni, Andrea, et autres
Publié: (2024)