We study multi unit auctions in presence of budget constraints. This situation is very common in real world but has not received proper attention in theoretical literature. We will study the impact of budget on the different aspects of multi unit auctions. These results try to define a frame work in which multi unit auctions with budget constraints are working and problem we are facing in desig...

This research addresses a general class of infrastructure asset management problems. Infrastructure agencies usually face budget uncertainties that will eventually lead to suboptimal planning if maintenance decisions are made without taking the uncertainty into consideration. It is important for decision makers to adopt maintenance scheduling policies that take future budget uncertainty into co...

This paper is concerned with a variation of the multiple knapsack problem (MKP) [5, 6], where we are given a set of n items N = {1, 2, . . . , n} to be packed into m possible knapsacks M = {1, 2, . . . ,m}. As in ordinary MKP, by w j and p j we denote the weight and profit of item j ∈ N respectively, and the capacity of knapsack i ∈ M is ci. However, a fixed cost fi is imposed if we use knapsac...

In a bilateral bargaining problem with private values, Hagerty and Rogerson (1987) showed that essentially all dominant strategy incentive compatible, ex post individually rational, and budget balanced mechanisms are posted-price mechanisms, where a price is drawn from a distribution, and trade occurs if both players benefit from trading at this price. We relax budget balancedness to feasibilit...

Abstract The terms “problem and solution” are omnipresent the world over in various design disciplines designers often position themselves as problem solvers. Through a rigorous exploration of different perspectives on problem-solution model its impact, this article revisits how define, perceive, consequently practice design. It closely explores frequently propagated terminology perceptions can...

in this paper, we present a binary-linear optimization model to prevent the spread of an infectious disease in a community. the model is based on the remotion of some connections in a contact network in order to separate infected nodes from the others. by using this model we nd an exact optimal solution and determine not only the minimum number of deleted links but also their exact positions. ...

We show that Karger’s randomized contraction method [7] can be adapted to multiobjective global minimum cut problems with a constant number of edge or node budget constraints to give efficient algorithms. For global minimum cuts with a single edge-budget constraint, our extension of the randomized contraction method has running time Õ(n3) in an n-node graph improving upon the best-known randomi...