The following pages link to (Q5817856):
Displaying 50 items.
- A test for risk-averse expected utility (Q281397) (← links)
- Optimal scaling of average queue sizes in an input-queued switch: an open problem (Q383214) (← links)
- Two-sided micro-matching with technical progress (Q431223) (← links)
- Probabilistic assignment of objects: characterizing the serial rule (Q449195) (← links)
- Optimal queue-size scaling in switched networks (Q473153) (← links)
- An experimental study on the incentives of the probabilistic serial mechanism (Q485790) (← links)
- A characterization of the extended serial correspondence (Q492874) (← links)
- Weak majorization and doubly substochastic operators on \(\ell^p(I)\) (Q498322) (← links)
- Alternating sign matrices, extensions and related cones (Q515803) (← links)
- Fractional matching markets (Q516999) (← links)
- Kidney exchange: an egalitarian mechanism (Q533096) (← links)
- König-Egerváry graphs are non-Edmonds (Q605001) (← links)
- Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication (Q623798) (← links)
- Permutation games: Another class of totally balanced games (Q792888) (← links)
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness (Q847819) (← links)
- Incentives in the probabilistic serial mechanism (Q848608) (← links)
- Decomposing random mechanisms (Q898659) (← links)
- A survey on assignment markets (Q908179) (← links)
- The probabilistic serial mechanism with private endowments (Q980972) (← links)
- Random assignment of multiple indivisible objects (Q1005770) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Substochastic matrices and von Neumann majorization (Q1089416) (← links)
- Majorization, doubly stochastic matrices, and comparison of eigenvalues (Q1120640) (← links)
- Some studies for a general \(n\)-person game arising from a generalization of von Neumann's assignment problem (Q1140038) (← links)
- A generalization of von Neumann's assignment problem and K. Fan's optimization result (Q1160077) (← links)
- About \((k, n)\) stochastic matrices (Q1259646) (← links)
- On removing a vertex from the assignment polytope (Q1260145) (← links)
- The supplier-firm-buyer game and its \(m\)-sided generalization (Q1277466) (← links)
- Probabilistic assignment: an extension approach (Q1649093) (← links)
- Equivalence of efficiency notions for ordinal assignment problems (Q1668490) (← links)
- On the consistency of random serial dictatorship (Q1670191) (← links)
- Consolidation for compact constraints and Kendall tau LP decodable permutation codes (Q1675286) (← links)
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties (Q1680097) (← links)
- Stability and the immediate acceptance rule when school priorities are weak (Q1684126) (← links)
- Impossibilities for probabilistic assignment (Q1697833) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- Remarks on the Monge-Kantorovich problem in the discrete setting (Q1701508) (← links)
- Partitions of the polytope of doubly substochastic matrices (Q1713297) (← links)
- Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
- A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism (Q1753688) (← links)
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron (Q1877595) (← links)
- Non-coupling from the past (Q1983063) (← links)
- Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
- Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces (Q2033155) (← links)
- Submajorization on \(\ell^p(I)^+\) determined by increasable doubly substochastic operators and its linear preservers (Q2042387) (← links)
- Fairness and efficiency for allocations with participation constraints (Q2044984) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
- Intrinsic sparsity of Kantorovich solutions (Q2080963) (← links)
