2013
Distances in Convex Polygons.
Proceedings of the Mathematics of Paul Erdős I, 2013
2008
Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead.
Manag. Sci., 2008
2007
Approval voting, 2nd edition.
Springer, ISBN: 978-0-387-49895-9, 2007
2006
Full Color Theorems for L(2, 1)-Colorings.
SIAM J. Discret. Math., 2006
2005
Subcyclic sets of linear orders.
Soc. Choice Welf., 2005
Going from theory to practice: the mixed success of approval voting.
Soc. Choice Welf., 2005
2004
2003
Extendability of Cyclic Orders.
Order, 2003
No-hole L(2, 1)-colorings.
Discret. Appl. Math., 2003
Facets of linear signed order polytopes.
Discret. Appl. Math., 2003
2002
Interference Patterns in Regular Graphs with Bijective Colorings.
SIAM J. Discret. Math., 2002
Acyclic sets of linear orders: A progress report.
Soc. Choice Welf., 2002
Subset Comparisons for Additive Linear Orders.
Math. Oper. Res., 2002
Containment orders for similar ellipses with a common center.
Discret. Math., 2002
A remarkable eight-point planar configuration.
Discret. Math., 2002
Pinwheel Scheduling: Achievable Densities.
Algorithmica, 2002
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
Fair division of indivisible items among people with similar preferences.
Math. Soc. Sci., 2001
Strong One-Switch Utility.
Manag. Sci., 2001
2000
Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity.
Soc. Choice Welf., 2000
Dynamic behavior of differential pricing and quality of service options for the internet.
Decis. Support Syst., 2000
Optimal linear arrangement of a rectangular grid.
Discret. Math., 2000
Interference patterns in bijective colorings of 2-regular graphs.
Discret. Appl. Math., 2000
1999
Interpolation by Convolutional Codes, Overload Distortion, and the Erasure Channel.
IEEE Trans. Inf. Theory, 1999
Preference Structures and Their Numerical Representations.
Theor. Comput. Sci., 1999
Linear Extensions of Semiorders: II.
Order, 1999
Finite three dimensional partial orders which are not sphere orders.
Discret. Math., 1999
1998
Interference-Minimizing Colorings of Regular Graphs.
SIAM J. Discret. Math., 1998
Isosceles Planar Subsets.
Discret. Comput. Geom., 1998
Subjective expected lexicographic utility: Axioms and assessment.
Ann. Oper. Res., 1998
1997
Super Arrovian Domains with Strict Preferences.
SIAM J. Discret. Math., 1997
Score certificates for tournaments.
J. Graph Theory, 1997
Bandwidth edge counts for linear arrangements of rectangular grids.
J. 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.
Discret. Math., 1997
The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming.
Discret. Appl. Math., 1997
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.
Discret. Appl. Math., 1997
Minimum Planar Sets with Maximum Equidistance Counts.
Comput. Geom., 1997
1996
Bipartite dimensions and bipartite degrees of graphs.
Discret. Math., 1996
Maximum planar sets that determine k distances.
Discret. Math., 1996
Decision Theory and Discrete Mathematics.
Discret. Appl. Math., 1996
1995
Covering properties of convolutional codes and associated lattices.
IEEE Trans. Inf. Theory, 1995
On a technique to calculate the exact performance of a convolutional code.
IEEE Trans. Inf. Theory, 1995
Stochastic Dominance on Unidimensional Grids.
Math. Oper. Res., 1995
Intervertex Distances in Convex Polygons.
Discret. Appl. Math., 1995
Multiplicities of Interpoint Distances in Finite Planar Sets.
Discret. Appl. Math., 1995
Proper and Unit Tolerance Graphs.
Discret. Appl. Math., 1995
Convex Polygons with Few Intervertex Distances.
Comput. Geom., 1995
1994
The normalized second moment of the binary lattice determined by a convolutional code.
IEEE Trans. Inf. Theory, 1994
Bell Inequalities, Grothendieck's Constant, and Root Two.
SIAM J. Discret. Math., 1994
A Postscript on Distances in Convex n-Gons.
Discret. Comput. Geom., 1994
Maximal Three-Independent Subsets of {0, 1, 2}.
Des. Codes Cryptogr., 1994
1993
Combinatorics and Partially Ordered Sets: Dimension Theory (William T. Trotter).
SIAM Rev., 1993
Lexicographic Ramsey Theory.
J. Comb. Theory A, 1993
Elemantary Sequences, Sub-Fibonacci Sequences.
Discret. Appl. Math., 1993
Sequence Based Methods for Data Transmission and Source Compression.
Proceedings of the Applied Algebra, 1993
1992
Utility as an Additive Set Function.
Math. Oper. Res., 1992
Dimensions of hypergraphs.
J. Comb. Theory B, 1992
Linear extensions of semiorders: a maximization problem.
Discret. Math., 1992
Correlation in Partially Ordered Sets.
Discret. Appl. Math., 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
1991
Midpoints of Diagonals of Convex <i>n</i>-GONS.
SIAM J. Discret. Math., 1991
A note on linear extensions and incomparable pairs.
J. Comb. Theory A, 1991
On the FKB conjecture for disjoint intersections.
Discret. Math., 1991
Sets uniquely determined by projections on axes II Discrete case.
Discret. Math., 1991
1990
Thicknesses of Ordered Sets.
SIAM J. Discret. Math., 1990
Binary Probabilities Induced by Rankings.
SIAM J. Discret. Math., 1990
The three-permutations problem.
Discret. Math., 1990
Discret. Appl. Math., 1990
1989
Equity Considerations in Public Risks Evaluation.
Oper. Res., 1989
The solution to Berlekamp's switching game.
Discret. Math., 1989
Pick-and-choose heuristics for partial set covering.
Discret. Appl. Math., 1989
1988
Unique Finite Difference Measurement.
SIAM J. Discret. Math., 1988
1987
Decision Analysis Under States-Additive SSB Preferences.
Oper. Res., 1987
Decomposing weighted digraphs into sums of chains.
Discret. Appl. Math., 1987
Discret. Appl. Math., 1987
1986
Proportional transitivity in linear extensions of ordered sets.
J. Comb. Theory B, 1986
Monotone subsequences in (0, 1)-matrices.
Graphs Comb., 1986
Functions that Never Agree.
Eur. J. Comb., 1986
Do local majorities force a global majority?
Discret. Math., 1986
1985
Classes of interval graphs under expanding length restrictions.
J. Graph Theory, 1985
Interval graphs and interval orders.
Discret. Math., 1985
A characterization of uniquely representable interval graphs.
Discret. Appl. Math., 1985
1984
Equity Axioms for Public Risks.
Oper. Res., 1984
Paradoxes of two-length interval orders.
Discret. Math., 1984
Probabilities of dominant candidates based on first-place votes.
Discret. Appl. Math., 1984
1983
Packing graphs with odd and even trees.
J. Graph Theory, 1983
On the sphericity and cubicity of graphs.
J. Comb. Theory B, 1983
Balanced Integer Arrays: A Matrix Packing Theorem.
J. Comb. Theory A, 1983
Interval lengths for interval orders: A minimization problem.
Discret. Math., 1983
1982
Simplest cases of nth-degree stochastic dominance.
Oper. Res. Lett., 1982
Scoring rule and majority agreements for large electorates with arbitrary preferences.
Math. Soc. Sci., 1982
Relative probabilities of majority winners under partial information.
Math. Soc. Sci., 1982
Dominant strategies and restricted ballots with variable electorate.
Math. Soc. Sci., 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.
Discret. Math., 1982
Monotonicity paradoxes in the theory of elections.
Discret. Appl. Math., 1982
1981
Uniqueness properties in finite-continuous additive measurement.
Math. Soc. Sci., 1981
Equivalences and Continuity in Multivalent Preference Structures.
Oper. Res., 1981
Inverted orders for monotone scoring rules.
Discret. Appl. Math., 1981
1980
On Unimodality for Linear Extensions of Partial Orders.
SIAM J. Algebraic Discret. Methods, 1980
Symmetric social choices and collective rationality.
Math. Soc. Sci., 1980
Multilinear Expected Utility.
Math. Oper. Res., 1980
Stochastic Dominance and Moments of Distributions.
Math. Oper. Res., 1980
1979
Condorcet proportions and Kelly's conjectures.
Discret. Appl. Math., 1979
Heights of representative systems.
Discret. Appl. Math., 1979
1978
Operations on binary relations.
Discret. Math., 1978
1977
Approximations of Two-Attribute Utility Functions.
Math. Oper. Res., 1977
Multicriteria Choice Functions Based on Binary Relations.
Oper. Res., 1977
1976
Win probabilities and simple majorities in probabilistic voting situations.
Math. Program., 1976
On linear extension majority graphs of partial orders.
J. Comb. Theory B, 1976
Utility Independence on Subsets of Product Sets.
Oper. Res., 1976
1975
Three-Valued Representative Systems.
Math. Syst. Theory, 1975
Generalized Utility Independence and Some Implications.
Oper. Res., 1975
1974
Technical Note - The Effectiveness of Ordinal Dominance in Decision Analysis.
Oper. Res., 1974
von Neumann-Morgenstera Utility Functions on Two Attributes.
Oper. Res., 1974
On the sum-of-ranks winner when losers are removed.
Discret. Math., 1974
1972
Partial orders of dimension 2.
Networks, 1972
1971
The Theorem of the Alternative in Social Choice Theory.
Oper. Res., 1971
1970
Intransitive Indifference in Preference Theory: A Survey.
Oper. Res., 1970
1969
Information Analysis Without States of the World.
Oper. Res., 1969
1968
An Abbreviated States of the World Decision Model.
IEEE Trans. Syst. Sci. Cybern., 1968
Sensitivity of Decisions to Probability Estimation Errors: A Reexamination.
Oper. Res., 1968
1967
Letter to the Editor - Additive Utilities with Incomplete Product Sets: Application to Priorities and Assignments.
Oper. Res., 1967
1966
On the Prospects of a Useful Unified Theory of Value for Engineering.
IEEE Trans. Syst. Sci. Cybern., 1966
Letter to the Editor - A Note on Recent Developments in Additive Utility Theories for Multiple-Factor Situations.
Oper. Res., 1966
