scientific article; zbMATH DE number 3095897
From MaRDI portal
zbMath0060.07906MaRDI QIDQ5834711
Publication date: 1946
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Convexity of the orbit-closed C-numerical range and majorization, Log-majorization Type Inequalities, Lifting for Simplicity: Concise Descriptions of Convex Sets, An Extremum Property of Sums of Eigenvalues, Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation, Partial Permutation and Alternating Sign Matrix Polytopes, Generalized Functions of Symmetric Matrices, Symmetric and Hankel-symmetric transportation polytopes, Unnamed Item, Unnamed Item, Sensor Scheduling for Space Object Tracking and Collision Alert, Monotonicity Conjecture on Permanents of Doubly Stochastic Matrices, Unnamed Item, Operational axioms for diagonalizing states, An exact one-particle theory of bosonic excitations: from a generalized Hohenberg–Kohn theorem to convexified N-representability, The object allocation problem with favoring upper ranks, Tristochastic operations and products of quantum states, ENVY‐FREE DIVISION USING MAPPING DEGREE, Exact first moments of the RV coefficient by invariant orthogonal integration, On an algorithm converging to hyperstochastic tensors, Strategy-proof and envy-free mechanisms for house allocation, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, Entropic model predictive optimal transport over dynamical systems, New views of the doubly stochastic single eigenvalue problem, On wastefulness of random assignments in discrete allocation problems, A new decomposition of the graph Laplacian and the binomial structure of mass-action systems, Monotonicity of certain left and right Riemann sums, Strategy-proof and envy-free random assignment, A graph space optimal transport distance as a generalization of L p distances: application to a seismic imaging inverse problem, A planner-optimal matching mechanism and its incentive compatibility in a restricted domain, Balanced equilibrium in pseudo-markets with endowments, Birkhoff–von Neumann's theorem, doubly normalized tensors, and joint measurability, Microcanonical thermodynamics in general physical theories, Unnamed Item, Convex matrix equations, Diagonal Sums of Doubly Substochastic Matrices, Birkhoff--von Neumann Graphs that are PM-Compact, Unnamed Item, The extreme points of certain polytopes of doubly substochastic matrices, A probabilistic solution of problem 111. of G. Birkhoff, Inferring Sparse Preference Lists from Partial Information, Discriminating strength: a bona fide measure of non-classical correlations, Closed Convex Hulls of Unitary Orbits in von Neumann Algebras, Dynamic discrete tomography, DESCRIPTION OF NON-ENDOMORPHIC MAXIMUM PERFECT CIPHERS WITH TWO-VALUED PLAINTEXT ALPHABET, Intersecting families of permutations, The four-dimensional Perfect-Mirsky Conjecture, Some remarks about acyclic and tridiagonal Birkhoff polytopes, On the support of extremal martingale measures with given marginals: the countable case, Efficiency and stability of probabilistic assignments in marriage problems, A minimal completion of (0, 1)-matrices without total support, Systems of representatives, When Is the Matching Polytope Box-Totally Dual Integral?, CHECKERBOARD COPULAS OF MAXIMUM ENTROPY WITH PRESCRIBED MIXED MOMENTS, A distance and a binary relation related to income comparisons, Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs, Birkhoff’s theorem for a family of probability spaces, Dominants and submissives of matching polyhedra, A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits, A Simple Counterexample to the Monge Ansatz in Multimarginal Optimal Transport, Convex Geometry of the Set of Kantorovich Plans, and the Frenkel--Kontorova Model, A Global Approach for Solving Edge-Matching Puzzles, Scheduling jobs of equal length: Complexity, facets and computational results, Uncertainty, joint uncertainty, and the quantum uncertainty principle, Positional Voting and Doubly Stochastic Matrices, The Doubly Stochastic Single Eigenvalue Problem: A Computational Approach, Extremal elements of a sublattice of the majorization lattice and approximate majorization, Efficient lottery design, Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron, Conditions for optimality in experimental designs, Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting), On the even permutation polytope, Trading probabilities along cycles, Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces, Fully non-linear elliptic equations on compact manifolds with a flat hyperkähler metric, Unital quantum channels - convex structure and revivals of Birkhoff's theorem, Inequalities and existence theorems in the theory of matrices, Stochastic tensors and approximate symmetry, Conjectured \textit{DXZ} decompositions of a unitary matrix, A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set, Open shop, satellite communication and a theorem by Egerváry (1931), Tightness for the cover time of the two dimensional sphere, A short note on extreme points of certain polytopes, Bounds on the number of 2-level polytopes, cones, and configurations, Multi-round cooperative search games with multiple players, Necessary and sufficient conditions for doubly stochasticity of infinite-dimensional quadratic operators, Sign matrix polytopes from Young tableaux, On flow polytopes, order polytopes, and certain faces of the alternating sign matrix polytope, Partial permutation and alternating sign matrix polytopes, A note on Mirsky's theorem, Unconditional reflexive polytopes, Marriage market with indifferences: a linear programming approach, The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices, Semi-magic matrices for dihedral groups, Unital affine semigroups, On endowments and indivisibility: partial ownership in the Shapley-Scarf model, The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices, On the vertices of the \(d\)-dimensional Birkhoff polytope, Fair-by-design matching, Tensor products of quantum mappings, Optimal transmission schedules for lightwave networks embedded with de Bruijn graphs, Consensus for Quantum Networks: Symmetry From Gossip Interactions, Probabilistic assignment of indivisible goods with single-peaked preferences, The extended serial correspondence on a rich preference domain, The extreme points of centrosymmetric transportation polytopes, Alberti-Uhlmann problem on Hardy-Littlewood-Pólya majorization, Non-coupling from the past, Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope, On the extreme points of a family of matrices related to a theorem of Birkhoff, Energies of \(S^{2}\)-valued harmonic maps on polyhedra with tangent boundary conditions, The skeleton of acyclic Birkhoff polytopes, The diameter of the acyclic Birkhoff polytope, Partitioned EDF scheduling on a few types of unrelated multiprocessors, The relaxation of two-well energies with possibly unequal moduli, Compromises and rewards: stable and non-manipulable probabilistic matching, Convex hulls of unitary orbits of normal elements in \(C^\ast\)-algebras with tracial rank zero, Comparison principle for second order elliptic operators and applications, The optimal order for the \(p\)-th moment of sums of independent random variables with respect to symmetric norms and related combinatorial estimates, Birkhoff's theorem and multidimensional numerical range, On a conjecture by Gale about one-sided matching problems, A note on the assignment problem with uniform preferences, Multidimensional permanents of polystochastic matrices, Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces, A Riemannian Fletcher--Reeves Conjugate Gradient Method for Doubly Stochastic Inverse Eigenvalue Problems, Majorization and a Schur-Horn theorem for positive compact operators, the nonzero kernel case, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching, When are efficient and fair assignment mechanisms group strategy-proof?, On the computation of Wasserstein barycenters, Fairness and efficiency for allocations with participation constraints, Applications of a theorem concerning sets with convex sections, Doubly stochastic matrices and the quantum channels, Deciding probabilistic bisimilarity distance one for probabilistic automata, A characterization of strongly stable fractional matchings, Fractional matching preclusion number of graphs and the perfect matching polytope, Ex-post favoring ranks: a fairness notion for the random assignment problem, The determinantal conjecture and Hadamard type inequalities, Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs, Spectra of convex hulls of matrix groups, A survey of semisimple algebras in algebraic combinatorics, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, On the extreme points of the set of substochastic and symmetric matrices, Faces of the polytope of doubly substochastic matrices, On 1-sum flows in undirected graphs, The Birkhoff theorem for unitary matrices of prime-power dimension, Extremal measures with prescribed marginals (finite case), Proofs of Two Theorems on Doubly-Stochastic Matrices, Efficient mixtures of priority rules for assigning objects, Random matching under priorities: stability and no envy concepts, Monotonicity versions of Epstein's Concavity Theorem and related inequalities, Intrinsic sparsity of Kantorovich solutions, Dimer models and Calabi-Yau algebras, Methods for scaling to doubly stochastic form, Birkhoff-von Neumann theorem and decomposition for doubly stochastic tensors, Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan, Efficient rules for probabilistic assignment, Tie-breaking and efficiency in the laboratory school choice, Maximizing expected powers of the angle between pairs of points in projective space, The canonical correlations of a 2\({\times}\)2 block matrix with given eigenvalues, A pessimist's approach to one-sided matching, Alternative formulations for the ordered weighted averaging objective, Some Results on Doubly Stochastic Matrices, Tropical determinant on transportation polytopes, Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes, Optimal transportation, topology and uniqueness, Doubly stochastic matrices and Schur-Weyl duality for partition algebras, Perturbation bounds for eigenvalues of diagonalizable matrices and singular values, Robust Hadamard matrices, unistochastic rays in Birkhoff polytope and equi-entangled bases in composite spaces, A test for risk-averse expected utility, Stable matchings and linear inequalities, Harmonic maps with defects, The invisible hand algorithm: solving the assignment problem with statistical physics, The number of faces of the tridiagonal Birkhoff polytope, The NIEP for four dimensional Leslie and doubly stochastic matrices with zero trace from the coefficients of the characteristic polynomial, Majorization and Stochastic maps in von Neumann algebras, Stochastic dynamics: Markov chains and random transformations, Inequity averse optimization in operational research, Incentives in the probabilistic serial mechanism, A note on the Davis-Kahan \(\sin\Theta\) theorem, Probabilistic assignment: an extension approach, Permutation polytopes and indecomposable elements in permutation groups, Restricted housewapping games, Necessary and sufficient conditions for multivariate majorization, Equivalence of efficiency notions for ordinal assignment problems, Majorization, doubly stochastic matrices, and comparison of eigenvalues, On the consistency of random serial dictatorship, König-Egerváry graphs are non-Edmonds, Consolidation for compact constraints and Kendall tau LP decodable permutation codes, An infinite dimensional Schur-Horn theorem and majorization theory, On the primitivity of Cayley digraphs, On characterizations of the probabilistic serial mechanism involving incentive and invariance properties, On extreme \(U_1\) matrices, Distributed strategies for generating weight-balanced and doubly stochastic digraphs, Stability and the immediate acceptance rule when school priorities are weak, Some properties of transforms in cultural theory, Parametric quantum search algorithm as quantum walk: a quantum simulation, Decomposing random mechanisms, Permanents of doubly stochastic trees., Impossibilities for probabilistic assignment, Partially concurrent open shop scheduling with integral preemptions, On a conjecture by D. Z. Dokovic, The Birkhoff theorem for unitary matrices of prime dimension, Closed convex hulls of unitary orbits in \(C^{\ast}\)-algebras of real rank zero, A transportation \(L^p\) distance for signal analysis, Wide partitions, Latin tableaux, and Rota's basis conjecture, A generalization of von Neumann's assignment problem and K. Fan's optimization result, Probabilistic assignment of objects: characterizing the serial rule, Partitions of the polytope of doubly substochastic matrices, Some facets of the polytope of even permutation matrices., Attitude toward imprecise information, Optimal queue-size scaling in switched networks, Efficient and fair assignment mechanisms are strongly group manipulable, Regularity of area minimizing currents I: gradient \(L^p\) estimates, An experimental study on the incentives of the probabilistic serial mechanism, \(G\)-decompositions of matrices and related problems. I., Directions in matrix theory, Auburn 1990, conference report, A characterization of the extended serial correspondence, Max-plus singular values, ADMM for the SDP relaxation of the QAP, Enumeration of 2-level polytopes, Clifford tori and unbiased vectors, Alternating sign matrices, extensions and related cones, The resource theory of informational nonequilibrium in thermodynamics, Fractional matching markets, On the efficiency of all-pay mechanisms, A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, Faces of faces of the acyclic Birkhoff polytope, Counting extreme \(U_1\) matrices and characterizing quadratic doubly stochastic operators, Copulas with maximum entropy, Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups, Supertropical matrix algebra, Geometric and probabilistic analysis of convex bodies with unconditional structures, and associated spaces of operators, Kidney exchange: an egalitarian mechanism, Factorization and dilation problems for completely positive maps on von Neumann algebras, Selected topics on assignment problems, Ordinal efficiency and the polyhedral separating hyperplane theorem, Maximum and minimum diagonal sums of doubly stochastic matrices, Efficiency under a combination of ordinal and cardinal information on preferences, Consistency in the probabilistic assignment model, The core and related solution concepts for infinite assignment games, The probabilistic serial mechanism with private endowments, Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function, An unbounded matroid intersection polyhedron, Regular choice systems: a general technique to represent them by random variables, Face counting on an acyclic Birkhoff polytope, On equality of some elements in matrices, An algorithm to approximate the optimal expected inner product of two vectors with given marginals, Random assignment of multiple indivisible objects, Uncapacitated flow-based extended formulations, Linear optimization over permutation groups, Ranking hypotheses to minimize the search cost in probabilistic inference models, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, The supplier-firm-buyer game and its \(m\)-sided generalization, All convex invariant functions of hermitian matrices, Spanning tree invariants, loop systems and doubly stochastic matrices, Doubly stochastic quadratic operators and Birkhoff's problem, Characterization, parity, and power sequences of locally finite doubly stochastic matrices, On permutations, convex hulls, and normal operators, Extreme symmetric stochastic matrices, Extreme points of intervals in \(C^*\)-algebras, Approximation theorems for positive operators on \(L^ p\)-spaces, Extreme doubly stochastic operators and characteristic functions, On Birkhoff's theorem for doubly stochastic completely positive maps of matrix algebras, A Schur-Horn-Kostant convexity theorem for the diffeomorphism group of the annulus, On a theorem of Wielandt and the compounds of unitary matrices
