#### Filter Results:

#### Publication Year

2003

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider an extension of the 2-person Rényi-Ulam liar game in which lies are governed by a channel C, a set of allowable lie strings of maximum length k. Carole selects x ∈ [n], and Paul makes t-ary queries to uniquely determine x. In each of q rounds, Paul weakly partitions [n] = A 0 ∪· · ·∪A t−1 and asks for a such that x ∈ A a. Carole responds with… (More)

JEL classification: C62 D63 D74 MSC: 52B05 91B32 Keywords: Fair division Envy-free Sperner's lemma Polytope Labelings a b s t r a c t We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility… (More)

In this paper we extend the work of Bogart and Trenk [3] and Fishburn and Trotter [6] in studying different classes of bitolerance orders. We provide a more comprehensive list of classes of bitolerance orders and prove equality between some of these classes in general and other classes in the bipartite domain. We also provide separating examples between… (More)

We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked preferences over the cakes. For two players, we show that disjoint envy-free piece selections may not exist for two cakes cut… (More)

In this note, we show that Fan's 1952 lemma on labelled triangulations of the n-sphere with n + 1 labels is equivalent to the Borsuk-Ulam theorem. Moreover, unlike other Borsuk-Ulam equivalents, this lemma directly implies Sperner's Lemma, so this proof may be regarded as a combinatorial version of the fact that the Borsuk-Ulam theorem implies the Brouwer… (More)

We study degree sequences for simplicial posets and polyhedral complexes, generalizing the well-studied graphical degree sequences. Here we extend the more common generalization of vertex-to-facet degree sequences by considering arbitrary face-to-flag degree sequences. In particular, these may be viewed as natural refinements of the flag f-vector of the… (More)

The flag Whitney numbers (also referred to as the flag f-numbers) of a geometric lattice count the number of chains of the lattice with elements having specified ranks. We give a collection of inequalities which imply all the linear inequalities satisfied by the flag Whitney numbers of rank 3 geometric lattices. We further describe the smallest closed… (More)

- ‹
- 1
- ›