#### Filter Results:

#### Publication Year

1980

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Some voting schemes that are in principle susceptible to control are nevertheless resistant in practice due to excessive computational costs; others are vulnerable. We illustrate this in detail for plurality voting and for Condorcet voting.

We give evidence that Single Tranferable Vote (STV) is computation-ally resistant to manipulation: It is NP-complete to determine whether there exists a (possibly insincere) preference that will elect a favored candidate , even in an election for a single seat. Thus strategic voting under STV is qualitatively more difficult than under other commonly-used… (More)

- John J. Bartholdi, Donald D. Eisenstein
- Operations Research
- 1996

In bucket brigade" manufacturing, such as recently introduced to the apparel industry, a production line has n workers moving among m stations, where each w orker independently follows a simple rule that determines what to do next. Our analysis suggests and experiments connrm that if the workers are sequenced from slowest to fastest then, independently of… (More)

- Loren K. Platzman, John J. Bartholdi
- J. ACM
- 1989

To construct a short tour through points in the plane, the points are sequenced as they appear along a spacefilling curve. This heuristic consists essentially of sorting, so it is easily coded and requires only <italic>O</italic>(<italic>N</italic>) memory and <italic>O</italic>(<italic>N</italic> log <italic>N</italic>) operations. Its performance is… (More)

- John J. Bartholdi, Donald D. Eisenstein, Robert D. Foley
- Operations Research
- 2001

" Bucket brigades " are a way of sharing work on a flow line that results in the spontaneous emergence of balance and consequent high throughput. All this happens without a work-content model or traditional assembly line balancing technology. Here we show that bucket brigades can be effective even in the presence of variability in the work content. In… (More)

- John J. Bartholdi, Kevin R. Gue
- Transportation Science
- 2004

W ithin both retail distribution and less-than-truckload transportation networks crossdocks vary greatly in shape. Docks in the shape of an I, L, or T are most common, but unusual ones may be found, including those in the shape of a U, H, or E. Is there a best shape? We show that the answer depends on the size of the facility and on the pattern of freight… (More)

The primary challenge for an urban bus system is to maintain constant headways between successive buses. Most bus systems try to achieve this by adherence to a schedule; but this is undermined by the tendency of headways to collapse, so that buses travel in bunches. To counter this, we propose a new method of coördinating buses. Our method abandons the idea… (More)

- John J. Bartholdi, Paul Goldsman
- IEEE Transactions on Visualization and Computer…
- 2004

We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously indexed with a space-filling curve that begins at one vertex of… (More)

- John J. Bartholdi, James B. Orlin, H. Donald Ratliff
- Operations Research
- 1980

A fundamental problem of cyclic staffing is to size and schedule a minimum-cost workforce so that sufficient workers are on duty during each time period. This may be modeled as an integer linear program with a cyclically structured 0-1 constraint matrix. We identify a large class of such problems for which special structure permits the ILP to be solved… (More)