The following pages link to Jay Sethuraman (Q607261):
Displaying 37 items.
- A note on the inefficiency of bidding over the price of a share (Q607262) (← links)
- House allocation with fractional endowments (Q637577) (← links)
- Effective routing and scheduling in adversarial queueing networks (Q818836) (← links)
- A solution to the random assignment problem on the full preference domain (Q860356) (← links)
- Stochastic scheduling in an in-forest (Q951118) (← links)
- (Q1424362) (redirect page) (← links)
- Ideal preemptive schedules on two processors (Q1424363) (← links)
- On a cutting plane heuristic for the stable roommates problem and its applications (Q1577118) (← links)
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective (Q1600095) (← links)
- A polynomial-time algorithm for the bistable roommates problem (Q1604203) (← links)
- How much inequality in income is fair? A microeconomic game theoretic perspective (Q1618605) (← links)
- Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems (Q1680106) (← links)
- A note on the assignment problem with uniform preferences (Q1785360) (← links)
- An alternative proof of a characterization of the TTC mechanism (Q1785480) (← links)
- (Un)stable matchings with blocking costs (Q2060342) (← links)
- Equal-quantile rules in resource allocation with uncertain needs (Q2231431) (← links)
- A note on object allocation under lexicographic preferences (Q2441234) (← links)
- Anonymous monotonic social welfare functions (Q2496234) (← links)
- (Q2741495) (← links)
- The Geometry of Fractional Stable Matchings and Its Applications (Q2757570) (← links)
- Bounded Size Graph Clustering with Applications to Stream Processing (Q2920135) (← links)
- (Q2921743) (← links)
- Online scheduling of packets with agreeable deadlines (Q2933633) (← links)
- (Q2934598) (← links)
- Lotteries in student assignment: An equivalence result (Q3081384) (← links)
- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Q3114728) (← links)
- The Complexity of Computing the Random Priority Allocation Matrix (Q3465944) (← links)
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective (Q3637390) (← links)
- A NonCooperative Approach to Cost Allocation in Joint Replenishment (Q4602471) (← links)
- Convergence of the Core in Assignment Markets (Q4971365) (← links)
- The Bipartite Rationing Problem (Q5166267) (← links)
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions (Q5387955) (← links)
- Many-to-One Stable Matching: Geometry and Fairness (Q5387998) (← links)
- Stochastic Search in a Forest Revisited (Q5388049) (← links)
- Integer Programming and Arrovian Social Welfare Functions (Q5704128) (← links)
- Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing <i>L<sub>p</sub></i> Norm of Costs (Q5739150) (← links)
- Characterizing the TTC rule via pair-efficiency: a short proof (Q6117767) (← links)
