scientific article; zbMATH DE number 3078983

Cited in

(only showing first 100 items - show all)

Random assignment of multiple indivisible objects
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
Polyhedral proof methods in combinatorial optimization
Substochastic matrices and von Neumann majorization
Majorization, doubly stochastic matrices, and comparison of eigenvalues
Some studies for a general n-person game arising from a generalization of von Neumann's assignment problem
A generalization of von Neumann's assignment problem and K. Fan's optimization result
About \((k, n)\) stochastic matrices
On removing a vertex from the assignment polytope
The supplier-firm-buyer game and its m-sided generalization
Probabilistic assignment: an extension approach
Equivalence of efficiency notions for ordinal assignment problems
On the consistency of random serial dictatorship
Consolidation for compact constraints and Kendall tau LP decodable permutation codes
On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
Stability and the immediate acceptance rule when school priorities are weak
Impossibilities for probabilistic assignment
Partially concurrent open shop scheduling with integral preemptions
Remarks on the Monge-Kantorovich problem in the discrete setting
Partitions of the polytope of doubly substochastic matrices
Efficient and fair assignment mechanisms are strongly group manipulable
A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
Non-coupling from the past
Compromises and rewards: stable and non-manipulable probabilistic matching
Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces
Submajorization on \(\ell^p(I)^+\) determined by increasable doubly substochastic operators and its linear preservers
Fairness and efficiency for allocations with participation constraints
Computing in combinatorial optimization
Efficient mixtures of priority rules for assigning objects
Intrinsic sparsity of Kantorovich solutions
Tie-breaking and efficiency in the laboratory school choice
A pessimist's approach to one-sided matching
Doubly stochastic matrices and Schur-Weyl duality for partition algebras
Trading probabilities along cycles
A competitive search game with a moving target
Unconditional reflexive polytopes
On endowments and indivisibility: partial ownership in the Shapley-Scarf model
Tensor products of quantum mappings
A game of hide and seek in networks
On the extreme points of a family of matrices related to a theorem of Birkhoff
The skeleton of acyclic Birkhoff polytopes
Search for an immobile hider on a stochastic network
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching
When are efficient and fair assignment mechanisms group strategy-proof?
The Plateau problem from the perspective of optimal transport
Random matching under priorities: stability and no envy concepts
Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
Efficient rules for probabilistic assignment
Efficient lottery design
Sign matrix polytopes from Young tableaux
On flow polytopes, order polytopes, and certain faces of the alternating sign matrix polytope
On the vertices of the d-dimensional Birkhoff polytope
Probabilistic assignment of indivisible goods with single-peaked preferences
The extended serial correspondence on a rich preference domain
Extreme points of the convex set of joint probability distributions with fixed marginals
Solution of the personnel classification problem with the method of optimal regions
A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set
Social welfare in search games with asymmetric information
Partial permutation and alternating sign matrix polytopes
A test for risk-averse expected utility
On 1-sum flows in undirected graphs
Regular Hypertournaments and Arc-Pancyclicity
Optimal transportation, topology and uniqueness
Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
John von Neumann 1903-1957
Optimal scaling of average queue sizes in an input-queued switch: an open problem
Results and problems in the theory of doubly-stochastic matrices
Concave gauge functions and applications
Two-sided micro-matching with technical progress
Probabilistic assignment of objects: characterizing the serial rule
Optimal queue-size scaling in switched networks
Validation of subgradient optimization
An experimental study on the incentives of the probabilistic serial mechanism
A characterization of the extended serial correspondence
Weak majorization and doubly substochastic operators on \(\ell^p(I)\)
Lifting for simplicity: concise descriptions of convex sets
Partial permutation and alternating sign matrix polytopes
On multi-symmetric functions and transportation polytopes
On semimonotone star matrices and linear complementarity problem
Network inspection for detecting strategic attacks
A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
Birkhoff-von Neumann graphs that are PM-compact
Inferring Sparse Preference Lists from Partial Information
Alternating sign matrices, extensions and related cones
Fractional matching markets
Kidney exchange: an egalitarian mechanism
Diagonal Sums of Doubly Substochastic Matrices
Motivation for working in numerical analysis
More on hidden Z-matrices and linear complementarity problem
Positional voting and doubly stochastic matrices
Systems of representatives
Symmetric magic squares and multivariate splines
Some remarks about acyclic and tridiagonal Birkhoff polytopes
Efficiency and stability of probabilistic assignments in marriage problems
An exact one-particle theory of bosonic excitations: from a generalized Hohenberg–Kohn theorem to convexified N-representability
König-Egerváry graphs are non-Edmonds
Lifts for Voronoi cells of lattices
The object allocation problem with favoring upper ranks

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 Q5817856)