In this article, we elaborate on a budget constrained extension of the r -interdiction median problem with fortification (RIMF). The objective in the RIMF is to find the optimal allocation of protection resources to a given service system consisting of p facilities so that the disruptive effects of r possible attacks to the system are minimized. The defender of the system needs to fortify q fac...

We consider the budget optimization problem faced by an advertiser participating in repeated sponsored search auctions, seeking to maximize the number of clicks attained under that budget. We cast the budget optimization problem as a Markov Decision Process (MDP) with censored observations, and propose a learning algorithm based on the wellknown Kaplan-Meier or product-limit estimator. We valid...

We study the setting in which a mobile searcher must locate hidden target bounded or unbounded search domain, with no information about hider's position. In particular, we consider online search, performance of strategy is evaluated by its worst case competitive ratio. introduce multi-criteria problem has budget on allotted time, and objective to design strategies that are competitively efficie...

In marketing planning, advertisers seek to maximize the number of customers by allocating given budgets to each media channel effectively. The budget allocation problem with a bipartite influence model captures this scenario; however, the model is problematic because it assumes there is only one advertiser in the market. In reality, there are many advertisers which are in conflict of advertisem...

This study aims to develop a multi-period distribution system design model that provides an integrated view of the various costs, service quality and budget concerns within the planning horizon, as well as computationally feasible methods for obtaining solutions in realistic situations. The key design decisions considered in each period are: the number and location of distribution centers in t...

Stochastic network design techniques can be used effectively to solve a wide range of planning problems in ecological sustainability. We propose a novel approximate algorithm based on the sample average approximation (SAA) and mixed integer programming (MIP) to efficiently address the problem of using a limited budget to remove instream barriers, which prevent fish from accessing their natural ...

This paper studies the optimal contest design problem when the abilities of the risk neutral contestants are independent private information. The contest designer has a fixed prize budget to elicit efforts from the contestants. We consider all possible mechanisms that allocate prizes and punishments (negative prizes) across the contestants. We find that an optimal contest mechanism does not exi...

Quality function deployment (QFD) is a systematic process for translating customer needs into engineering characteristics, and then communicating them throughout the enterprise in a way to ensure that details are quantified and controlled. The inherent fuzziness of relationships in QFD modeling justifies the use of fuzzy regression for estimating the relationships between both customer needs an...

There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem satisfying weak budget balance, individual rationality, and minimizing the budget imbalance. This calls for designing an appropriate rebate function. Our main result is an impossibility theorem which rules out linear rebate...