This paper studies the budget-feasible mechanism design over graphs, where a buyer wishes to procure items from sellers, and all participants (the sellers) can only directly interact with their neighbors during auction campaign. The problem for is use limited budget incentivize sellers propagate information neighbors, thereby more will be informed of item value procured. An impossibility result...

Copyright is held by the author/owner(s). CHI’15 , April 18–23, 2015, Seoul, Republic of Korea. Abstract In our research project, dubbed BudgetWiser, we focus on the government budget, one of the most important policy documents of a government. Our goal is to increase public interests in the budget and encourage public participation in the budgeting process by leveraging open government data. W...

We consider the problem of a revenue-maximizing seller with m items for sale to n additive bidders with hard budget constraints, assuming that the seller has some prior distribution over bidder values and budgets. The prior may be correlated across items and budgets of the same bidder, but is assumed independent across bidders. We target mechanisms that are Bayesian Incentive Compatible, but th...

We consider the maximization of a gross substitutes utility function under budget constraints. This problem naturally arises in applications such as exchange economies in mathematical economics and combinatorial auctions in (algorithmic) game theory. We show that this problem admits a polynomial-time approximation scheme (PTAS). More generally, we present a PTAS for maximizing a discrete concav...

Delay budget is an excess delay that each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. This paper presents the idea of incrementally re-assigning the delay budgets allotted to different components of a design, which leads to avoiding the re-execution of the intensive budget assignment procedure in ea...

In this paper, we propose a real-time admission control mechanism in conjunction with revenue optimization for DS-CDMA network. For solving the optimization problem, iteration-based Lagrangean relaxation approach is applied by allocating a time budget. The achievement in terms of problem formulation and performance analysis is presented. Associated parameters considered are mean arrival rate, m...

The budget network design problem and fixed-charge network design problem imply different economic pursuits on travel cost and construction cost and structure these two cost components in different ways. A more general version of these two classic formulations is the biobjective network design problem. This article discusses an exact solution strategy for the biobjective discrete network design...

centralizing and using proper transportation facilities cut down costs and traffic. hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. a distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

This paper considers problems of the following type: We are given an edge weighted graph G = (V;E). It is assumed that each edge e of the given network has an associated function ce that speci es the cost of shortening the edge by a given amount and that there is a budget B on the total reduction cost. The goal is to develop a reduction strategy satisfying the budget constraint so that the tota...