the aim of this study was to determine the optimal cutting cycle in an uneven-aged beech forest in the north of iran. first of all, a logistic growth model was determined for an uneven aged forest. then, the stumpage price was predicted via an autoregressive model. the average stumpage price of beech was derived from actual timber, round wood, fire and pulpwood prices at road side minus the var...

We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation—as these terms are used in the fair-division literature—one, divide-and-conquer (D&C), minimizes the maximum number of players that any ...

We extend the classic cake-cutting problem to a situation in which the ”cake” is divided among families. Each piece of cake is owned and used simultaneously by all members of the family. A typical example of such a cake is land. We examine three ways to assess the fairness of such a division, based on the classic no-envy criterion: (a) Average envy-freeness means that for each family, the avera...

Search for an adapted forage species for feed production under existing marginal lands and harsh conditions is needed to overcome sever feed shortage in Egypt. Sesbania, Sesbania aegyptiaca (Sesbania sesban, L) has shown potential for forage production and being included in grazing systems, especially on marginal lands and salt–affected soils. An experiment was conducted in the summer of 2004 a...

The aim of this study was to determine the optimal cutting cycle in an uneven-aged beech forest in the North of Iran. First of all, a logistic growth model was determined for an uneven aged forest. Then, the stumpage price was predicted via an autoregressive model. The average stumpage price of beech was derived from actual timber, round wood, fire and pulpwood prices at road side minus the var...

An unceasing problem of our prevailing society is the fair division of goods. The problem of fair cake cutting is dividing a heterogeneous and divisible resource, the cake, among n players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at least as much as her proportional share. I...

Fair allocation of goods or resources among various agents is a central task in multiagent systems and other fields. The specific setting where just one divisible resource is to be divided fairly is commonly referred to as cake cutting, and agents are called players in this setting. Cake-cutting protocols aim at dividing a cake and assigning the resulting portions to several players in a way th...