This empirical study addresses the research questions of how and why BI is used or not used to support the flexibility and integration needs in budgeting. Budgeting is considered a process with four main activities namely budget construction, budget consolidation, budget monitoring and budget reporting which belong equally to the flexibility and integration domains. Empirical data is obtained f...

We study a dynamic mechanism design problem for a network of interdependent strategic agents with coupled dynamics. In contrast to the existing results for static settings, we present a dynamic mechanism that is incentive compatible, individually rational, budget balanced, and social welfare maximizing. We utilize the correlation among agents’ states over time, and determine a set of inference ...

resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...

We study the budgeted bandit problem, where each arm is associated with both a reward and a cost. In a budgeted bandit problem, the objective is to design an arm pulling algorithm in order to maximize the total reward before the budget runs out. In this work, we study both multi-armed bandits and linear bandits, and focus on the setting with continuous random costs. We propose an upper confiden...

In settings where full incentive-compatibility is not available, such as core-constraint combinatorial auctions and budget-balanced combinatorial exchanges, we may wish to design mechanisms that are as incentive-compatible as possible. This paper offers a new characterization of approximate incentive-compatibility by casting the pricing problem as a meta-game between the center and the particip...

In a typical video rate allocation problem, the objective is to optimally distribute a source rate budget among a set of (in)dependently coded data units to minimize the total distortion of all units. Conventional Lagrangian approaches convert the lone rate constraint to a linear rate penalty scaled by a multiplier in the objective, resulting in a simpler unconstrained formulation. However, the...

We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximation (SAA) scheme to translate this stochastic problem into a simulation-based deterministic optimization problem, and present a detailed empirical study of three variants of the problem: where all purchases are made upfront, whe...

In this paper, an income tax competition model is considered, in which two local governments collect income taxes for both redistributional purposes, as well as to fund the provision of local public goods. The local governments seek to maximize the average utility of their residents, while a finite population of perfectly mobile, heterogeneous agents make labor/leisure and residency decisions, ...

In this paper, a new model of phytoplankton growth in the chemostat is proposed. First, we give a description of the chemostat and we recall the main models: the simple Monod model, experimentally validated for bacteria growth and the Droop model, which is validated for phytoplankton growth and takes into account the possible nutrient storage. Though our model is quite similar to the Droop one,...

In this paper, we study a budget constrained location problem in which we simultaneously consider opening some new facilities and closing some existing facilities. Motivations for this problem stem from applications where, due to a change in the distribution of customer demand, the existing facility system no longer provides adequate service. The objective is to minimize the total weighted trav...