In acceptance sampling plans, the decisions on either accepting or rejecting a specific batch is still a challenging problem. In order to provide a desired level of protection for customers as well as manufacturers, in this paper, a new acceptance sampling design is proposed to accept or reject a batch based on Bayesian modeling to update the distribution function of the percentage of nonconfor...

This paper presents a risk-based approach to resilient network design. The basic design problem considered is that given a working network and a fixed budget, how best to allocate the budget for deploying a survivability technique in different parts of the network based on managing the risk. The term risk measures two related quantities: the likelihood of failure or attack, and the amount of da...

An interesting application of Cmfp is for the case when the capacities of the arcs in the network are not fixed but can be increased at certain costs per unit (see e.g. [Ful59, KNR98, SK98]). One is allowed to spend a certain budget for raising capacities and wishes to maximize the throughput. This network improvement problem can be formulated as an instance of Cmfp where the cost functions on ...

We consider the problem of budget feasible mechanism design proposed by Singer (2010), but in a Bayesian setting. A principal has a public value for hiring a subset of the agents and a budget, while the agents have private costs for being hired. We consider both additive and submodular value functions of the principal. We show that there are simple, practical, ex post budget balanced posted pri...

Purpose This study aims to investigate the influence of budgeting design characteristics on perceived usefulness, based enabling-coercive framework. Design/methodology/approach paper develops a survey in one large publicly-listed Brazilian company that operates electric utility industry. The sample comprises 75 middle managers from different areas this organization. uses structural equation mod...

We consider the class of max-min and min-max optimization problems subject to a global budget constraint. We undertake a systematic algorithmic and complexity-theoretic study of such problems, which we call problems design problems. Every optimization problem leads to a natural design problem. Our main result uses techniques of Freund-Schapire [FS99] from learning theory, and its generalization...

In online display advertising, the prevalent method advertisers employ to acquire impressions is to contract with an intermediary. These contracts involve upfront payments made by the advertisers to the intermediary, in exchange for running their campaigns on their behalf. This paper studies the optimal contract offered by the intermediary in a setting where advertisers’ budgets and targeting c...

We study the problem of allocating items to two agents with arbitrary valuation functions. Instead of actual money, we use sequential auctions with “scrip money”, i.e. money that has no value outside the auction. By considering such scrip auctions as a special case of more general bidding games, we show that there exists a natural pure subgame perfect Nash equilibrium (PSPE) with the following ...

We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph G = (V,E), a weight function w : V → R, a budget function b : V → Z, and a positive integer B. The weight (resp. budget) of a subset of vertices is the sum of weights (resp. budgets) of the vertices in the subset. A k-budgeted...