scientific article; zbMATH DE number 3078983
From MaRDI portal
zbMath0050.14105MaRDI QIDQ5817856
Publication date: 1953
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Efficient lottery design, Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron, Polyhedral proof methods in combinatorial optimization, A test for risk-averse expected utility, Lifting for Simplicity: Concise Descriptions of Convex Sets, Substochastic matrices and von Neumann majorization, Trading probabilities along cycles, Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces, Partial Permutation and Alternating Sign Matrix Polytopes, Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness, Incentives in the probabilistic serial mechanism, On multi-symmetric functions and transportation polytopes, Probabilistic assignment: an extension approach, A competitive search game with a moving target, On semimonotone star matrices and linear complementarity problem, Solution of the personnel classification problem with the method of optimal regions, Network Inspection for Detecting Strategic Attacks, Equivalence of efficiency notions for ordinal assignment problems, Majorization, doubly stochastic matrices, and comparison of eigenvalues, A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set, On the consistency of random serial dictatorship, Concave gauge functions and applications, König-Egerváry graphs are non-Edmonds, Consolidation for compact constraints and Kendall tau LP decodable permutation codes, Optimal scaling of average queue sizes in an input-queued switch: an open problem, On characterizations of the probabilistic serial mechanism involving incentive and invariance properties, Social welfare in search games with asymmetric information, Stability and the immediate acceptance rule when school priorities are weak, Sign matrix polytopes from Young tableaux, Some studies for a general \(n\)-person game arising from a generalization of von Neumann's assignment problem, On flow polytopes, order polytopes, and certain faces of the alternating sign matrix polytope, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, Partial permutation and alternating sign matrix polytopes, Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication, Regular Hypertournaments and Arc-Pancyclicity, Decomposing random mechanisms, Unconditional reflexive polytopes, Impossibilities for probabilistic assignment, Partially concurrent open shop scheduling with integral preemptions, John von Neumann 1903-1957, Remarks on the Monge-Kantorovich problem in the discrete setting, Two-sided micro-matching with technical progress, A survey on assignment markets, On endowments and indivisibility: partial ownership in the Shapley-Scarf model, A generalization of von Neumann's assignment problem and K. Fan's optimization result, Probabilistic assignment of objects: characterizing the serial rule, On the vertices of the \(d\)-dimensional Birkhoff polytope, Partitions of the polytope of doubly substochastic matrices, Diagonal Sums of Doubly Substochastic Matrices, Tensor products of quantum mappings, Birkhoff--von Neumann Graphs that are PM-Compact, A game of hide and seek in networks, Optimal queue-size scaling in switched networks, Probabilistic assignment of indivisible goods with single-peaked preferences, The extended serial correspondence on a rich preference domain, Efficient and fair assignment mechanisms are strongly group manipulable, Inferring Sparse Preference Lists from Partial Information, 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)\), Non-coupling from the past, Extreme points of the convex set of joint probability distributions with fixed marginals, On the extreme points of a family of matrices related to a theorem of Birkhoff, Alternating sign matrices, extensions and related cones, Fractional matching markets, A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism, The skeleton of acyclic Birkhoff polytopes, Kidney exchange: an egalitarian mechanism, Compromises and rewards: stable and non-manipulable probabilistic matching, Results and problems in the theory of doubly-stochastic matrices, The probabilistic serial mechanism with private endowments, Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces, 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?, Random assignment of multiple indivisible objects, Submajorization on \(\ell^p(I)^+\) determined by increasable doubly substochastic operators and its linear preservers, Fairness and efficiency for allocations with participation constraints, About \((k, n)\) stochastic matrices, On removing a vertex from the assignment polytope, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, The supplier-firm-buyer game and its \(m\)-sided generalization, On 1-sum flows in undirected graphs, Computing in combinatorial optimization, The Plateau problem from the perspective of optimal transport, Efficient mixtures of priority rules for assigning objects, Random matching under priorities: stability and no envy concepts, Intrinsic sparsity of Kantorovich solutions, Motivation for working in numerical analysis, Permutation games: Another class of totally balanced games, 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, More on hidden Z-matrices and linear complementarity problem, Positional Voting and Doubly Stochastic Matrices, A pessimist's approach to one-sided matching, Optimal transportation, topology and uniqueness, Validation of subgradient optimization, Doubly stochastic matrices and Schur-Weyl duality for partition algebras, An exact one-particle theory of bosonic excitations: from a generalized Hohenberg–Kohn theorem to convexified N-representability, Lifts for Voronoi cells of lattices, The object allocation problem with favoring upper ranks, On an algorithm converging to hyperstochastic tensors, Strategy-proof and envy-free mechanisms for house allocation, On wastefulness of random assignments in discrete allocation problems, A new decomposition of the graph Laplacian and the binomial structure of mass-action systems, A planner-optimal matching mechanism and its incentive compatibility in a restricted domain, Balanced equilibrium in pseudo-markets with endowments, Symmetric magic squares and multivariate splines, Some remarks about acyclic and tridiagonal Birkhoff polytopes, Efficiency and stability of probabilistic assignments in marriage problems, Systems of representatives
