Educational Achievement and the Allocation of School Resources The school resources – educational outcomes debate has focused almost exclusively on spending levels. We extend this by analysing the relationship between student achievement and schools’ budget allocation decisions using panel data. Per-pupil expenditure has only a modest relationship with improvement in students’ standardised test...

We study the social planner’s problem of designing a mechanism to optimally allocate a set of public services to a set of heterogeneous agents with private utilities, without the ability to differentiate agents by charging prices or requiring costly effort. This is motivated by the 2012-2013 Boston school choice reform, in which social planners had to design a school choice lottery to allocate ...

  The present study is an attempt towards remodeling cost, revenue and profit relationship within the network process. The previous models of Data Envelopment Analysis (DEA) have been too general in their scope and focused on the input and the output within a black box system, therefore they have not been able to measure various phases simultaneously within a network system. By using these mod...

In this paper, we dealt with one problem in designing a production line, which is the problem of buffer allocation. A selection approach was developed and tested for selecting the best design for a huge number of alternatives set. The proposed selection approach is a combination between cardinal and ordinal optimization. The algorithm involves four procedures; ordinal optimization, optimal comp...

The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications. First, we examine the problem of allocating a given storage budget over a set of nodes for maximum reliability. The objective is to find an allocation of the budget that maximizes the probability of successful recovery by a data collector ac...

A computational grid is composed of a set of resource consumers and resources providers. Usually these entities are independent and making decisions autonomously based on their policies and resource allocation in such systems is a challenging problem. In such systems using market-like techniques for this problem regulates the supply and demand for resources, provides an incentive for providers,...

We study online auction settings in which agents arrive and depart dynamically in a random (secretary) order, and each agent’s private type consists of the agent’s arrival and departure times, value and budget. We consider multi-unit auctions with additive agents for the allocation of both divisible and indivisible items. For both settings, we devise truthful mechanisms that give a constant app...

In this paper we attempt to introduce dynamics into the theory of cooperative games. A solution of the game is reached through an allocation process. At each stage of the allocation process of a cooperative game a budget of fixed size is distributed among the players. In the first part of this note we study a type of process that, at any stage, endows the budget to a player whose contribution t...

For a given set of quantizers and a data vector, the optimal bit allocation in a rate/distortion sense is the sequence of quantizers which minimizes the overall distortion for a given bit budget. In an operational framework, this sequence is dependent on the data realization rather than on its probabilistic model and the cost of describing the sequence itself becomes therefore part of the bit b...