Description
Book Synopsis.- On the Problem of Best Arm Retention.
.- Clustering with a Knapsack Constraint: Parameterized Approximation Algorithms for the Knapsack Median Problem.
.- On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores.
.- How to Play Old Maid with Virtual Players.
.- Algorithms for Optimally Shifting Intervals under Intersection Graph Models.
.- On the Fine-grained Complexity of Approximating Max k-Coverage.
.- Nested and Interleaved Ticketing for Multiple Travelers.
.- Longest (k]-tuple Common Substrings.
.- Scheduling two types of jobs with minimum makespan.
.- Blockchain Technology for Digital Asset Ownership.
.- On the Optimal Mixing Problem of Approximate Nash Equilibria in Bimatrix Games.
.- Finding Fair and Efficient Allocations Under Budget Constraints.
.- Computations and Complexities of Tarski's Fixed Points and Supermodular Games.
.- Parity-Constrained k-Supplier Problem.
.- Approximating Principal-Agent Problem under Bayesian.
.- Robust Facility Leasing Problem with Penalties.
.- Randomized Strategyproof Mechanisms for Multi-stage Facility Location Problem with Capacity Constraints.
.- From Evolutionary Game Dynamics to Non-negative Matrix Factorization: Acceleration with Hessian Geometry.
.- A case for Copeland: from theory to practice.
.- Deterministic and Universal Truthful Mechanism for Fair Matching.
.- Equilibrium Strategies of Carbon Emission Reduction in Agricultural Product Supply Chain under Carbon Sink Trading.
.- Active Learning Supported Iterative Combinatorial Auctions.
.- Locating Two Facilities on a Square with a Minimum Distance Requirement.
