scientific article; zbMATH DE number 1757951

MaRDI QIDQ4537739zbMATH OpenFDO

Authors Tamás Fleiner

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810105

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial optimization (90C27)

Recommendations

• On the stable marriage polytope
• Algorithms and Computation
• Stable matchings with ties, master preference lists, and matroid constraints
• A Fixed-Point Approach to Stable Matchings and Some Applications
• Characterization of stable matchings as extreme points of a polytope

Cited in

(29)

• On the stable b-matching polytope.
• Antimatroids induced by matchings
• Designing matching mechanisms under constraints: an approach from discrete convex analysis
• Applications of discrete convex analysis to mathematical economics
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• Envy-free matchings with lower quotas
• On the set of many-to-one strongly stable fractional matchings
• Stable schedule matchings
• A general two-sided matching market with discrete concave utility functions
• Blockers and antiblockers of stable matchings
• Strategyproof allocation mechanisms with endowments and M-convex distributional constraints
• A matroid approach to stable matchings with lower quotas
• Recent developments in discrete convex analysis
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• scientific article; zbMATH DE number 1146237 (Why is no real title available?)
• A matroid generalization of the super-stable matching problem
• Finding a stable allocation in polymatroid intersection
• scientific article; zbMATH DE number 7278072 (Why is no real title available?)
• Matroidal choice functions
• On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
• A matroid approach to stable matchings with lower quotas
• Semi-streaming algorithms for submodular matroid intersection
• Semi-streaming algorithms for submodular matroid intersection
• Efficient matching under general constraints
• Solving the maximum popular matching problem with matroid constraints
• Non-distributive lattices, stable matchings, and linear optimization
• Meritocracy versus diversity
• On matroid parity and matching polytopes
• Two algorithms for the student-project allocation problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537739)