This paper discusses cake-cutting protocols when the cake is a heterogeneous good, represented by an interval on the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Meta-envy-free means there is no envy on role assignments, that is, no party wants to exchange his/her role in the protocol with the one of any o...

This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Though envy-freeness was considered to be one of the most important desirable properties, envy-freeness does not prevent envy about role a...

The current generation of CASE tools mainly provides rigid and unnexible support for editing, storage, veriication and transformation of speciications. Information engineers have to adapt their way of working to CASE tools instead of vice versa. To enable a more exi-ble, method independent, support of information engineers, the concept of a CASE shell has emerged. Crucial for CASE shells is the...

We study classic cake-cutting problems, but in discrete models rather than using infiniteprecision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and movingknife), we roughly partition the various fair-allocation problems into 3 classes: “easy” (constant number of rounds of logar...

We consider the classic cake-divison problem when the cake is a heterogeneous good represented by an interval in the real line. We provide a mechanism to implement, in an anonymous way, an envy-free and e¢cient allocation when agents have private information on their preferences. The mechanism is a multistep sequential game form in which each agent at each step receives a morsel of the cake tha...

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

This paper deals with application of polyaniline coated on wood sawdust for removal ofmethylene blue (MB) dye from aqueous solutions. Polyaniline coated onto sawdust (termedas PAn/SD) was prepared via direct chemical polymerization onto sawdust which waspreviously soaked in the monomer (aniline) solution in acidic (HC1) media. Adsorptionexperiments were carried out using batch system. The effec...

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...

In this paper, we apply the local fractional Adomian decomposition and variational iteration methods to obtain the analytic approximate solutions of Fredholm integral equations of the second kind within local fractional derivative operators. The iteration procedure is based on local fractional derivative. The obtained results reveal that the proposed methods are very efficient and simple tools ...