Perfect Division
   HOME
*





Perfect Division
Exact division, also called consensus division, is a partition of a continuous resource (" cake") into some ''k'' pieces, such that each of ''n'' people with different tastes agree on the value of each of the pieces. For example, consider a cake which is half chocolate and half vanilla. Alice values only the chocolate and George values only the vanilla. The cake is divided into three pieces: one piece contains 20% of the chocolate and 20% of the vanilla, the second contains 50% of the chocolate and 50% of the vanilla, and the third contains the rest of the cake. This is an exact division (with ''k''=3 and ''n''=2), as both Alice and George value the three pieces as 20%, 50% and 30% respectively. Several common variants and special cases are known by different terms: * Consensus halving – the cake should be partitioned into two pieces (''k''=2), and all agents agree that the pieces have equal values. *Consensus 1/''k''-division, for any constant ''k''>1 - the cake should be partition ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Fair Cake-cutting
Fair cake-cutting is a kind of fair division problem. The problem involves a ''heterogeneous'' resource, such as a cake with different toppings, that is assumed to be ''divisible'' – it is possible to cut arbitrarily small pieces of it without destroying their value. The resource has to be divided among several partners who have different preferences over different parts of the cake, i.e., some people prefer the chocolate toppings, some prefer the cherries, some just want as large a piece as possible. The division should be ''unanimously'' fair - each person should receive a piece that he or she believes to be a fair share. The "cake" is only a metaphor; procedures for fair cake-cutting can be used to divide various kinds of resources, such as land estates, advertisement space or broadcast time. The prototypical procedure for fair cake-cutting is divide and choose, which is mentioned already in the book of Genesis. It solves the fair division problem for two people. The modern ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Stone–Tukey Theorem
In mathematical measure theory, for every positive integer the ham sandwich theorem states that given measurable "objects" in -dimensional Euclidean space, it is possible to divide each one of them in half (with respect to their measure, e.g. volume) with a single -dimensional hyperplane. This is even possible if the objects overlap. It was proposed by Hugo Steinhaus and proved by Stefan Banach (explicitly in dimension 3, without taking the trouble to state the theorem in the -dimensional case), and also years later called the Stone–Tukey theorem after Arthur H. Stone and John Tukey. Naming The ham sandwich theorem takes its name from the case when and the three objects to be bisected are the ingredients of a ham sandwich. Sources differ on whether these three ingredients are two slices of bread and a piece of ham , bread and cheese and ham , or bread and butter and ham . In two dimensions, the theorem is known as the pancake theorem to refer to the flat nature of the two ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


PPA Complete
In computational complexity theory, PPA is a complexity class, standing for "Polynomial Parity Argument" (on a graph). Introduced by Christos Papadimitriou in 1994 (page 528), PPA is a subclass of TFNP. It is a class of search problems that can be shown to be total by an application of the handshaking lemma: ''any undirected graph that has a vertex whose degree is an odd number must have some other vertex whose degree is an odd number''. This observation means that if we are given a graph and an odd-degree vertex, and we are asked to find some other odd-degree vertex, then we are searching for something that is guaranteed to exist (so, we have a total search problem). Definition PPA is defined as follows. Suppose we have a graph on whose vertices are n-bit binary strings, and the graph is represented by a polynomial-sized circuit that takes a vertex as input and outputs its neighbors. (Note that this allows us to represent an exponentially-large graph on which we can efficiently pe ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


PPA (complexity)
In computational complexity theory, PPA is a complexity class, standing for "Polynomial Parity Argument" (on a graph). Introduced by Christos Papadimitriou in 1994 (page 528), PPA is a subclass of TFNP. It is a class of search problems that can be shown to be total by an application of the handshaking lemma: ''any undirected graph that has a vertex whose degree is an odd number must have some other vertex whose degree is an odd number''. This observation means that if we are given a graph and an odd-degree vertex, and we are asked to find some other odd-degree vertex, then we are searching for something that is guaranteed to exist (so, we have a total search problem). Definition PPA is defined as follows. Suppose we have a graph on whose vertices are n-bit binary strings, and the graph is represented by a polynomial-sized circuit that takes a vertex as input and outputs its neighbors. (Note that this allows us to represent an exponentially-large graph on which we can efficiently pe ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Tucker's Lemma
In mathematics, Tucker's lemma is a combinatorial analog of the Borsuk–Ulam theorem, named after Albert W. Tucker. Let T be a triangulation of the closed ''n''-dimensional ball B_n. Assume T is antipodally symmetric on the boundary sphere S_. That means that the subset of simplices of T which are in S_ provides a triangulation of S_ where if σ is a simplex then so is −σ. Let L:V(T)\to\ be a labeling of the vertices of T which is an odd function on S_, i.e, L(-v) = -L(v) for every vertex v\in S_. Then Tucker's lemma states that T contains a ''complementary edge'' - an edge (a 1-simplex) whose vertices are labelled by the same number but with opposite signs. Proofs The first proofs were non-constructive, by way of contradiction. Later, constructive proofs were found, which also supplied algorithms for finding the complementary edge. Basically, the algorithms are path-based: they start at a certain point or edge of the triangulation, then go from simplex to simplex accor ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Envy-free Cake-cutting
An envy-free cake-cutting is a kind of fair cake-cutting. It is a division of a heterogeneous resource ("cake") that satisfies the envy-free criterion, namely, that every partner feels that their allocated share is at least as good as any other share, according to their own subjective valuation. When there are only two partners, the problem is easy and was solved in antiquity by the divide and choose protocol. When there are three or more partners, the problem becomes much more challenging. Two major variants of the problem have been studied: * Connected pieces, e.g. if the cake is a 1-dimensional interval then each partner must receive a single sub-interval. If there are n partners, only n-1 cuts are needed. * General pieces, e.g. if the cake is a 1-dimensional interval then each partner can receive a union of disjoint sub-intervals. Short history Modern research into the fair cake-cutting problem started in the 1940s. The first fairness criterion studied was proportional divi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Austin Moving-knife Procedures
The Austin moving-knife procedures are procedures for equitable division of a cake. They allocate each of ''n'' partners, a piece of the cake which this partner values as ''exactly'' 1/n of the cake. This is in contrast to proportional division procedures, which give each partner ''at least'' 1/n of the cake, but may give more to some of the partners. When n=2, the division generated by Austin's procedure is an exact division and it is also envy-free. Moreover, it is possible to divide the cake to any number ''k'' of pieces which both partners value as exactly 1/''k''. Hence, it is possible to divide the cake between the partners in any fraction (e.g. give 1/3 to Alice and 2/3 to George). When n>2, the division is neither exact nor envy-free, since each partner only values his own piece as 1/n, but may value other pieces differently. The main mathematical tool used by Austin's procedure is the intermediate value theorem (IVT). Two partners and half-cakes The basic procedures ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Intermediate Value Theorem
In mathematical analysis, the intermediate value theorem states that if f is a continuous function whose domain contains the interval , then it takes on any given value between f(a) and f(b) at some point within the interval. This has two important corollaries: # If a continuous function has values of opposite sign inside an interval, then it has a root in that interval (Bolzano's theorem). # The image of a continuous function over an interval is itself an interval. Motivation This captures an intuitive property of continuous functions over the real numbers: given ''f'' continuous on ,2/math> with the known values f(1) = 3 and f(2) = 5, then the graph of y = f(x) must pass through the horizontal line y = 4 while x moves from 1 to 2. It represents the idea that the graph of a continuous function on a closed interval can be drawn without lifting a pencil from the paper. Theorem The intermediate value theorem states the following: Consider an interval I = ,b/math> of real n ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Austin Moving-knife Procedure
The Austin moving-knife procedures are procedures for equitable division of a cake. They allocate each of ''n'' partners, a piece of the cake which this partner values as ''exactly'' 1/n of the cake. This is in contrast to proportional division procedures, which give each partner ''at least'' 1/n of the cake, but may give more to some of the partners. When n=2, the division generated by Austin's procedure is an exact division and it is also envy-free. Moreover, it is possible to divide the cake to any number ''k'' of pieces which both partners value as exactly 1/''k''. Hence, it is possible to divide the cake between the partners in any fraction (e.g. give 1/3 to Alice and 2/3 to George). When n>2, the division is neither exact nor envy-free, since each partner only values his own piece as 1/n, but may value other pieces differently. The main mathematical tool used by Austin's procedure is the intermediate value theorem (IVT). Two partners and half-cakes The basic procedures ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Advances In Mathematics
''Advances in Mathematics'' is a peer-reviewed scientific journal covering research on pure mathematics. It was established in 1961 by Gian-Carlo Rota. The journal publishes 18 issues each year, in three volumes. At the origin, the journal aimed at publishing articles addressed to a broader "mathematical community", and not only to mathematicians in the author's field. Herbert Busemann writes, in the preface of the first issue, "The need for expository articles addressing either all mathematicians or only those in somewhat related fields has long been felt, but little has been done outside of the USSR. The serial publication ''Advances in Mathematics'' was created in response to this demand." Abstracting and indexing The journal is abstracted and indexed in:Abstracting and Indexing
*

picture info

Hyperplane
In geometry, a hyperplane is a subspace whose dimension is one less than that of its ''ambient space''. For example, if a space is 3-dimensional then its hyperplanes are the 2-dimensional planes, while if the space is 2-dimensional, its hyperplanes are the 1-dimensional lines. This notion can be used in any general space in which the concept of the dimension of a subspace is defined. In different settings, hyperplanes may have different properties. For instance, a hyperplane of an -dimensional affine space is a flat subset with dimension and it separates the space into two half spaces. While a hyperplane of an -dimensional projective space does not have this property. The difference in dimension between a subspace and its ambient space is known as the codimension of with respect to . Therefore, a necessary and sufficient condition for to be a hyperplane in is for to have codimension one in . Technical description In geometry, a hyperplane of an ''n''-dimensi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]