Peter C. Fishburn

According to our database1, Peter C. Fishburn authored at least 136 papers between 1966 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 





Distances in Convex Polygons.
Proceedings of the Mathematics of Paul Erdős I, 2013

Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead.
Management Science, 2008

Approval voting, 2nd edition.
Springer, ISBN: 978-0-387-49895-9, 2007

Full Color Theorems for L(2, 1)-Colorings.
SIAM J. Discrete Math., 2006

Subcyclic sets of linear orders.
Social Choice and Welfare, 2005

Going from theory to practice: the mixed success of approval voting.
Social Choice and Welfare, 2005

Weak order polytopes.
Discrete Mathematics, 2004

Extendability of Cyclic Orders.
Order, 2003

No-hole L(2, 1)-colorings.
Discrete Applied Mathematics, 2003

Facets of linear signed order polytopes.
Discrete Applied Mathematics, 2003

Interference Patterns in Regular Graphs with Bijective Colorings.
SIAM J. Discrete Math., 2002

Acyclic sets of linear orders: A progress report.
Social Choice and Welfare, 2002

Subset Comparisons for Additive Linear Orders.
Math. Oper. Res., 2002

Containment orders for similar ellipses with a common center.
Discrete Mathematics, 2002

A remarkable eight-point planar configuration.
Discrete Mathematics, 2002

Pinwheel Scheduling: Achievable Densities.
Algorithmica, 2002

A nail-biting election.
Social Choice and Welfare, 2001

Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets.
Order, 2001

Counting Split Interval Orders.
Order, 2001

Linear Discrepancy and Bandwidth.
Order, 2001

Counting Split Semiorders.
Order, 2001

Almost Connected Orders.
Order, 2001

Fair division of indivisible items among people with similar preferences.
Mathematical Social Sciences, 2001

Strong One-Switch Utility.
Management Science, 2001

Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity.
Social Choice and Welfare, 2000

Concordance Graphs.
Eur. J. Comb., 2000

Dynamic behavior of differential pricing and quality of service options for the internet.
Decision Support Systems, 2000

Optimal linear arrangement of a rectangular grid.
Discrete Mathematics, 2000

Interference patterns in bijective colorings of 2-regular graphs.
Discrete Applied Mathematics, 2000

Interpolation by Convolutional Codes, Overload Distortion, and the Erasure Channel.
IEEE Trans. Information Theory, 1999

Preference Structures and Their Numerical Representations.
Theor. Comput. Sci., 1999

Cycle Orders.
Order, 1999

Linear Extensions of Semiorders: II.
Order, 1999

Split semiorders.
Discrete Mathematics, 1999

Finite three dimensional partial orders which are not sphere orders.
Discrete Mathematics, 1999

Interference-Minimizing Colorings of Regular Graphs.
SIAM J. Discrete Math., 1998

Isosceles Planar Subsets.
Discrete & Computational Geometry, 1998

Subjective expected lexicographic utility: Axioms and assessment.
Annals OR, 1998

Super Arrovian Domains with Strict Preferences.
SIAM J. Discrete Math., 1997

Score certificates for tournaments.
Journal of Graph Theory, 1997

Bandwidth edge counts for linear arrangements of rectangular grids.
Journal of Graph Theory, 1997

Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars.
First Monday, 1997

Distinct distances in finite planar sets.
Discrete Mathematics, 1997

The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming.
Discrete Applied Mathematics, 1997

On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.
Discrete Applied Mathematics, 1997

Minimum Planar Sets with Maximum Equidistance Counts.
Comput. Geom., 1997

Bipartite dimensions and bipartite degrees of graphs.
Discrete Mathematics, 1996

Maximum planar sets that determine k distances.
Discrete Mathematics, 1996

Decision Theory and Discrete Mathematics.
Discrete Applied Mathematics, 1996

Covering properties of convolutional codes and associated lattices.
IEEE Trans. Information Theory, 1995

On a technique to calculate the exact performance of a convolutional code.
IEEE Trans. Information Theory, 1995

Stochastic Dominance on Unidimensional Grids.
Math. Oper. Res., 1995

Intervertex Distances in Convex Polygons.
Discrete Applied Mathematics, 1995

Multiplicities of Interpoint Distances in Finite Planar Sets.
Discrete Applied Mathematics, 1995

Proper and Unit Tolerance Graphs.
Discrete Applied Mathematics, 1995

Convex Polygons with Few Intervertex Distances.
Comput. Geom., 1995

The normalized second moment of the binary lattice determined by a convolutional code.
IEEE Trans. Information Theory, 1994

Bell Inequalities, Grothendieck's Constant, and Root Two.
SIAM J. Discrete Math., 1994

A Postscript on Distances in Convex n-Gons.
Discrete & Computational Geometry, 1994

Maximal Three-Independent Subsets of {0, 1, 2}.
Des. Codes Cryptography, 1994

Combinatorics and Partially Ordered Sets: Dimension Theory (William T. Trotter).
SIAM Review, 1993

Lexicographic Ramsey Theory.
J. Comb. Theory, Ser. A, 1993

Elemantary Sequences, Sub-Fibonacci Sequences.
Discrete Applied Mathematics, 1993

Sequence Based Methods for Data Transmission and Source Compression.
Proceedings of the Applied Algebra, 1993

Utility as an Additive Set Function.
Math. Oper. Res., 1992

Niche numbers.
Journal of Graph Theory, 1992

Dimensions of hypergraphs.
J. Comb. Theory, Ser. B, 1992

Linear extensions of semiorders: a maximization problem.
Discrete Mathematics, 1992

Correlation in Partially Ordered Sets.
Discrete Applied Mathematics, 1992

Unit Distances Between Vertices of a Convex Polygon.
Comput. Geom., 1992

Covering Properties of Binary Convolutional Codes and Lattice Quantization of Uniform Sources.
Proceedings of the Coding And Quantization, 1992

Midpoints of Diagonals of Convex n-GONS.
SIAM J. Discrete Math., 1991

A note on linear extensions and incomparable pairs.
J. Comb. Theory, Ser. A, 1991

On the FKB conjecture for disjoint intersections.
Discrete Mathematics, 1991

Sets uniquely determined by projections on axes II Discrete case.
Discrete Mathematics, 1991

Thicknesses of Ordered Sets.
SIAM J. Discrete Math., 1990

Binary Probabilities Induced by Rankings.
SIAM J. Discrete Math., 1990

The three-permutations problem.
Discrete Mathematics, 1990

Van Lier sequences.
Discrete Applied Mathematics, 1990

Equity Considerations in Public Risks Evaluation.
Operations Research, 1989

The solution to Berlekamp's switching game.
Discrete Mathematics, 1989

Pick-and-choose heuristics for partial set covering.
Discrete Applied Mathematics, 1989

Unique Finite Difference Measurement.
SIAM J. Discrete Math., 1988

Decision Analysis Under States-Additive SSB Preferences.
Operations Research, 1987

Decomposing weighted digraphs into sums of chains.
Discrete Applied Mathematics, 1987

Letter to the editor.
Discrete Applied Mathematics, 1987

Proportional transitivity in linear extensions of ordered sets.
J. Comb. Theory, Ser. B, 1986

Monotone subsequences in (0, 1)-matrices.
Graphs and Combinatorics, 1986

Functions that Never Agree.
Eur. J. Comb., 1986

Do local majorities force a global majority?
Discrete Mathematics, 1986

Classes of interval graphs under expanding length restrictions.
Journal of Graph Theory, 1985

Interval graphs and interval orders.
Discrete Mathematics, 1985

A characterization of uniquely representable interval graphs.
Discrete Applied Mathematics, 1985

Equity Axioms for Public Risks.
Operations Research, 1984

Paradoxes of two-length interval orders.
Discrete Mathematics, 1984

Probabilities of dominant candidates based on first-place votes.
Discrete Applied Mathematics, 1984

Packing graphs with odd and even trees.
Journal of Graph Theory, 1983

On the sphericity and cubicity of graphs.
J. Comb. Theory, Ser. B, 1983

Balanced Integer Arrays: A Matrix Packing Theorem.
J. Comb. Theory, Ser. A, 1983

Interval lengths for interval orders: A minimization problem.
Discrete Mathematics, 1983

Scoring rule and majority agreements for large electorates with arbitrary preferences.
Mathematical Social Sciences, 1982

Relative probabilities of majority winners under partial information.
Mathematical Social Sciences, 1982

Dominant strategies and restricted ballots with variable electorate.
Mathematical Social Sciences, 1982

Finite-Degree Utility Independence.
Math. Oper. Res., 1982

Moment-Preserving Shifts and Stochastic Dominance.
Math. Oper. Res., 1982

Aspects of semiorders within interval orders.
Discrete Mathematics, 1982

Monotonicity paradoxes in the theory of elections.
Discrete Applied Mathematics, 1982

Uniqueness properties in finite-continuous additive measurement.
Mathematical Social Sciences, 1981

Equivalences and Continuity in Multivalent Preference Structures.
Operations Research, 1981

Inverted orders for monotone scoring rules.
Discrete Applied Mathematics, 1981

On Unimodality for Linear Extensions of Partial Orders.
SIAM J. Matrix Analysis Applications, 1980

Symmetric social choices and collective rationality.
Mathematical Social Sciences, 1980

Multilinear Expected Utility.
Math. Oper. Res., 1980

Stochastic Dominance and Moments of Distributions.
Math. Oper. Res., 1980

Condorcet proportions and Kelly's conjectures.
Discrete Applied Mathematics, 1979

Heights of representative systems.
Discrete Applied Mathematics, 1979

Operations on binary relations.
Discrete Mathematics, 1978

Approximations of Two-Attribute Utility Functions.
Math. Oper. Res., 1977

Multicriteria Choice Functions Based on Binary Relations.
Operations Research, 1977

Win probabilities and simple majorities in probabilistic voting situations.
Math. Program., 1976

On linear extension majority graphs of partial orders.
J. Comb. Theory, Ser. B, 1976

Utility Independence on Subsets of Product Sets.
Operations Research, 1976

Three-Valued Representative Systems.
Mathematical Systems Theory, 1975

Generalized Utility Independence and Some Implications.
Operations Research, 1975

Technical Note - The Effectiveness of Ordinal Dominance in Decision Analysis.
Operations Research, 1974

von Neumann-Morgenstera Utility Functions on Two Attributes.
Operations Research, 1974

On the sum-of-ranks winner when losers are removed.
Discrete Mathematics, 1974

Partial orders of dimension 2.
Networks, 1972

The Theorem of the Alternative in Social Choice Theory.
Operations Research, 1971

Intransitive Indifference in Preference Theory: A Survey.
Operations Research, 1970

Information Analysis Without States of the World.
Operations Research, 1969

An Abbreviated States of the World Decision Model.
IEEE Trans. Systems Science and Cybernetics, 1968

Sensitivity of Decisions to Probability Estimation Errors: A Reexamination.
Operations Research, 1968

Letter to the Editor - Additive Utilities with Incomplete Product Sets: Application to Priorities and Assignments.
Operations Research, 1967

On the Prospects of a Useful Unified Theory of Value for Engineering.
IEEE Trans. Systems Science and Cybernetics, 1966

Letter to the Editor - A Note on Recent Developments in Additive Utility Theories for Multiple-Factor Situations.
Operations Research, 1966