✦ LIBER ✦

A characterization of the rational mean neat voting rules

✍ Scribed by William S. Zwicker

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 417 KB
Volume: 48
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2008.05.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sophisticated voting rules: the case of

Sophisticated voting rules: the case of two tournaments

✍ Sanjay Srivastava; Michael A. Trick 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 801 KB

The mu-basis of a rational ruled surface

✍ Falai Chen; Jianmin Zheng; Thomas W. Sederberg 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 101 KB

The mu-basis of a planar rational curve is a polynomial ideal basis comprised of two polynomials that greatly facilitates computing the implicit equation of the curve. This paper defines a mu-basis for a rational ruled surface, and presents a simple algorithm for computing the mu-basis. The mu-basis

Revisiting the μ-basis of a rational rul

Revisiting the μ-basis of a rational ruled surface

✍ Falai Chen; Wenping Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Reparametrization of a rational ruled su

Reparametrization of a rational ruled surface using the μ-basis

✍ Falai Chen 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 87 KB

This paper discusses a direct application of the µ-basis in reparametrizing a rational ruled surface. Using the µ-basis, we construct a new ruled surface, which is a dual of the original surface. A reparametrization can then be obtained from the µ-basis of the dual ruled surface. The reparametrized

A characterization for the boundedness o

A characterization for the boundedness of geometric mean operator

✍ P. Jain; A.P. Singh 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 307 KB

give a characterization for the geometric mean inequality to hold for the case 0 < Q < p 2 00, p > 1, where f is positive a.e. on (0, oo).

A characterization of the minimum cycle

A characterization of the minimum cycle mean in a digraph

✍ Richard M. Karp 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Let C = (V, E) be a digraph wl,th n vertices. Let f be a function from E illto the real numbem, associating with each edg~t: e EE a weight f(e). Given any sequence of edges 0 = el, e2, , . . , ep define w(a), the wei@ of a, as CyS 1 f(q), and define m(o), the mean weight of u, as w(a)&. Let A\* ==mi