Efficient Rounding Scheme for Weighted Proportional Allocation of Indivisible Chores with Subsidy
There exists a rounding scheme that computes a weighted proportional allocation of indivisible chores to a group of weighted agents with a total subsidy of at most n/3 - 1/6.
Efficient Objective Improvement Approach for Solving Discounted Payoff Games
The authors devise a novel symmetric approach to solve discounted payoff games by building a constraint system using every edge and updating the objective function to minimize the error or offset of the selected outgoing edges for each vertex. This challenges the traditional strategy improvement or value iteration methods for solving payoff games.
Optimizing Messaging Policies Through Simulation-Based Queries in Bayesian Persuasion
The sender can improve their messaging policy by querying a simulation oracle that provides information about the receiver's optimal actions given different messaging policies. The sender's optimal querying policy can be computed efficiently using dynamic programming.
© 2024 by Linnk AI