In this paper we suggest a new efficient technique for solving integer knapsack problems. Our algorithms can be seen as application of Fast Fourier Transform to generating functions of integer polytopes. Using this approach, it is possible to count the number of boolean solutions of a single...

We consider truthful implementation of the socially efficient allocation in an independent private-value environment in which agents receive private information over time. We propose a suitable generalization of the pivot mechanism, based on the marginal contribution of each agent. In the...

We consider truthful implementation of the socially efficient allocation in an independent private-value environment in which agents receive private information over time. We propose a suitable generalization of the pivot mechanism, based on the marginal contribution of each agent. In the...

An uninformed sender designs a mechanism that discloses information about her type to a privately informed receiver, who then decides whether to act. I impose a single-crossing assumption, so that the receiver with a higher type is more willing to act. Using a linear programming approach, I...

The Vehicle Routing Problem (VRP) has recently piqued the interest of researchers seeking to improve the efficiency and efficacy of the transportation system in distributing commodities. Many scholars have proposed using a heterogeneous fleet in vehicle routing to minimize distribution costs...