The standard approach to fair rent division assumes that agents have quasi-linear utilities, and seeks allocations that are envy free; it underlies an algorithm that is widely used in practice. However, this approach does not take budget constraints into account, and, therefore, may assign agents to rooms they cannot afford. By contrast, we design a polynomial-time algorithm that takes budget c...

To control ever-increasing costs, global budget payment has gained attention but has unclear impacts on health care systems. We propose the CAP framework that helps navigate 3 domains of difficult design choices in global budget payment: Constraints in resources (capitation vs facility-based budgeting; hard vs soft budget constraints), Agent-principal in resource allocation (individual vs group...

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...

The dietetics practitioner involved with menu planning in hospitals, nursing homes, schools, prisons, nd other settings where the focus on ealth and quality is balanced with udget restraints has always been hallenged with providing the best roduct for the money. Today, dietetics ractitioners confront even greater diffiulty as the demand for food and enrgy across the globe has resulted in apid p...

Given a directed acyclic graph with timing constraints, the budget management problem is to assign to each vertex an incremental delay such that the total sum of these delays is maximized without violating given constraints. We propose the notion of slack sensitivity and budget gradient to demonstrate characteristics of budget management. We develop an optimal polynomial-time algorithm for the ...