We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may result in a suboptimal division from the social welfare standpoint. Here, we show that in some cases, discarding some of the cake and fairly dividing only the remainder may be socially preferable to any fair division of th...

the present work was carried out to evaluate the removal of p-nitrophenol by adsorption onto olive cake based activated carbon having a bet surface area of 672 m²/g. the batch adsorption experimental results indicated that the equilibrium time for nitrophenol adsorption by olive cake-based activated carbon was 120min. the adsorption data was modeled by equilibrium and kinetic models. the pseudo...

Stochastic sequential bargaining games (Merlo and Wilson (1995, 1998)) have found wide applications in various …elds including political economy and macroeconomics due to their ‡exibility in explaining delays in reaching an agreement. In this paper, we present new results in nonparametric identi…cation of such models under di¤erent scenarios of data availability. First, we give conditions for a...

Native de-oiled and treated castor seed meal was subjected to proximate analysis and quantification of anti-nutrients (phytochemicals). Seed cake was treated by biochemical technique of solid state fermentation with Aspergillus niger and addition of calcium oxide (CaO) to give treated castor seed meal (TCSM). One hundred and twenty Japanese quails (Coturnix coturnix japonica) were fed four (4) ...

Cake is a hybrid system which provides reasoning facilities for the Programmer's Apprentice. This paper describes the architecture of Cake, which is divided into eight layers, each with associated representations and reasoning procedures. The operation of Cake is illustrated by a complete trace of the solution of an example reasoning problem. We also argue that a hybrid system in general is cha...

We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may result in a suboptimal division from the social welfare standpoint. Here, we show that in some cases, discarding some of the cake and fairly dividing only the remainder may be socially preferable to any fair division of th...

We consider discrete protocols for the classical Steinhaus cake cutting problem. Under mild technical conditions, we show that any deterministic strategy-proof protocol for two agents in the standard Robertson-Webb query model is dictatorial, that is, there is a fixed agent to which the protocol allocates the entire cake. For n > 2 agents, a similar impossibility holds, namely there always exis...

We study the classic problem of fairly dividing a heterogeneous resource (”cake”) among several agents with different preferences. In our setting, the resource is already divided among several ”old” agents. When ”young” agents come, the resource should be re-divided in a way that is fair both for the young and for the old agents. Motivated by land redivision and other two-dimensional division p...

Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on fairness and consider a strikingly weak notion of truthfulness. In this paper we investigate the problem of...