Alan D. Taylor

Q: What Schools Are Affiliated With Alan D. Taylor

Alan D. Taylor is affiliated with the following schools: Dartmouth College, Princeton University, Stanford University, Union College, New York, University of Maine

Alan D. Taylor's AcademicInfluence.com Rankings

Alan D. Taylor

Mathematics

#1912

World Rank

#3035

Historical Rank

#771

USA Rank

Differential Geometry

#55

World Rank

#66

Historical Rank

#21

USA Rank

Geometry

#153

World Rank

#225

Historical Rank

#30

USA Rank

Group Theory

#226

World Rank

#267

Historical Rank

#48

USA Rank

mathematics Degrees

Download Badge

Mathematics

Alan D. Taylor's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is Alan D. Taylor Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Alan Dana Taylor is an American mathematician who, with Steven Brams, solved the problem of envy-free cake-cutting for an arbitrary number of people with the Brams–Taylor procedure. Taylor received his Ph.D. in 1975 from Dartmouth College.

(See a Problem?)

Alan D. Taylor's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Fair division - from cake-cutting to dispute resolution (1998) (1095)
AN ENVY-FREE CAKE DIVISION PROTOCOL (1995) (259)
Simple games - desirability relations, trading, pseudoweightings (1999) (243)
Social choice and the mathematics of manipulation (2005) (241)
The win-win solution - guaranteeing fair shares to everybody (1999) (195)
Mathematics and politics : strategy, voting, power and proof (1997) (173)
Mathematics And Politics (1995) (164)
A characterization of weighted voting (1992) (101)
A Canonical Partition Relation for Finite Subsets of omega (1976) (100)
Saturation properties of ideals in generic extensions. I (1982) (68)
A Moving-Knife Solution to the Four-Person Envy-Free Cake-Division Problem (1995) (67)
Partition theorems and ultrafilters (1978) (61)
On splitting stationary subsets of large cardinals (1977) (57)
Simple Games (2000) (51)
Structural properties of ideals (1982) (51)
The Manipulability of Voting Systems (2002) (46)
Divide the Dollar: Three solutions and extensions (1994) (27)
A Peculiar Connection Between the Axiom of Choice and Predicting the Future (2008) (26)
Regularity properties of ideals and ultrafilters (1979) (26)
Old and new moving-knife schemes (1995) (24)
An introduction to infinite hat problems (2008) (24)
SATURATION PROPERTIES OF IDEALS IN GENERIC EXTENSIONS (2010) (23)
Simple Games and Magic Squares (1995) (23)
Bounds for the Disjoint Unions Theorem (1981) (21)
The Mathematics of Coordinated Inference: A Study of Generalized Hat Problems (2013) (20)
Analysis of binary voting algorithms for use in fault-tolerant and secure computing (2010) (19)
Diamond Principles, Ideals and the Normal Moore Space Problem (1981) (17)
A Procedure for Divorce Settlements (1996) (17)
Preference relations and measures in the context of fair division (1995) (17)
Hervé Moulin, Fair Division and Collective Welfare (2004) (16)
On saturated sets of ideals and Ulam's problem (1980) (14)
An Envy-Free Cake Division Algorithm (1992) (10)
Counting Quota Systems: A Combinatorial Question from Social Choice Theory (1995) (9)
Tight bounds on plurality (2005) (9)
Separating ultrafilters on uncountable cardinals (1984) (9)
Minimal predictors in hat problems (2010) (9)
A Glimpse of Impossibility (1997) (9)
A Note on van der Waerden's Theorem (1982) (8)
Interval measures of power (1997) (8)
The Mathematics of Coordinated Inference (2013) (7)
Yes-No Voting (1995) (7)
Divide-the-dollar (1996) (5)
Quasi-weightings, Trading, and Desirability Relations in Simple Games (1996) (5)
Ideals on uncountable cardinals (1978) (5)
Partitions of pairs of reals (1978) (5)
Fair Division by Point Allocation (1993) (4)
Limit-like predictability for discontinuous functions (2009) (4)
The FLOW-MATIC and MATH-MATIC automatic programming systems (1960) (4)
A note on a lemma of Shelah concerning stationary sets (1981) (3)
A paradoxical Pareto frontier in the cake-cutting context (2005) (2)
The cardinality of reduced power set algebras (1988) (2)
Prediction problems and ultrafilters on ω (2012) (1)
Two Stage Auctions I: Private-Value Strategies (1992) (1)
Social Choice Functions (2005) (1)
Two Stage Auctions II: Common-Value Strategies and the Winner's Curse (1992) (1)
Negative partition relations for ultrafilters on uncountable cardinals (1984) (1)
Diverse Homogeneous Sets (1992) (1)
Geometric Object #2: The Radon–Nikodym Set (RNS) (2005) (0)
The Geometry of Efficient Fair Division: Strong Pareto Optimality (2005) (0)
Towards a Structure Theory for Ideals on P κ λ.A Beginning for Structural Properties of Ideals on P κ λ (1991) (0)
Envy-freeness and equitability for n = 2 (1996) (0)
Game Theory, Procedure, and Consent: Focusing on (2016) (0)
The Geometry of Efficient Fair Division: The Shape of the IPS (2005) (0)
More Political Power (1995) (0)
Proportionality for n > 2: the indivisible case (1996) (0)
A Paradox Arising from the Elimination of a Paradox (2019) (0)
Three Solutions to Divide the Dollar (1991) (0)
Applications of the point-allocation procedures (1996) (0)
Notation and Preliminaries (2005) (0)
Social Choice and the Mathematics of Manipulation: More on Resolute Procedures (2005) (0)
A NOTE ON A LEMMA OF SHELAH (2010) (0)
Review: Donna M. Carr, Donald H. Pelletier, J. Steprans, S. Watson, Towards a Structure Theory for Ideals on $P_\kappa\lambda$; William S. Zwicker, A Beginning for Structural Properties of Ideals on $P_\kappa\lambda$ (1991) (0)
Geometric Object #1a: The Individual Pieces Set (IPS) for Two Players (2005) (0)
Characterizing Pareto Optimality III: The RNS, Weller's Construction, and w -Association (2005) (0)
The Topological Setting (2013) (0)
More Social Choice (1995) (0)
The Finite Setting (2013) (0)
Fair Division Pareto-Optimality Versus Strategic Robustness (1993) (0)
More on Non-Resolute Procedures (2005) (0)
Fair division: Envy-free procedures for arbitrary n (1996) (0)
Social Choice and the Mathematics of Manipulation: An Introduction to Social Choice Theory (2005) (0)
Social Choice and the Mathematics of Manipulation: Resolute Voting Rules (2005) (0)
The Geometry of Efficient Fair Division: The Relationship Between the IPS and the RNS (2005) (0)
Proportionality for n = 2 (1996) (0)
Characterizing Pareto Optimality: Introduction and Preliminary Ideas (2005) (0)
Characterizing Pareto Optimality I: The IPS and Optimization of Convex Combinations of Measures (2005) (0)
The Denumerable Setting: One-Way Visibility (2013) (0)
Characterizing Pareto Optimality Using Hyperreal Numbers (2005) (0)
Dual Hat Problems, Ideals, and the Uncountable (2013) (0)
Social Choice and the Mathematics of Manipulation: Ultrafilters and the Infinite (2005) (0)
Other Issues Involving Weller's Construction, Partition Ratios, and Pareto Optimality (2005) (0)
Fair Division and Politics (1995) (0)
Non-Resolute Voting Rules (2005) (0)
Borel separability of the coanalytic Ramsey sets (2006) (0)
The Denumerable Setting: Full Visibility (2013) (0)
Back Matter (2000) (0)
The Geometry of Efficient Fair Division: What the IPS Tells Us About Fairness and Efficiency in the Two-Player Context (2005) (0)
Old and NewMoving-Knife Schemes (1994) (0)
Characterizing Pareto Optimality II: Partition Ratios (2005) (0)
Trading properties and Alexandrov kernels for Boolean functions (2000) (0)
The Geometry of Efficient Fair Division: The Individual Pieces Set (IPS) and the Full Individual Pieces Set (FIPS) for the General n -Player Context (2005) (0)
Generalizations and Galois-Tukey Connections (2013) (0)
Geometric Object #1d: The Multicake Individual Pieces Set (MIPS) Symmetry Restored (2005) (0)
A pr 2 01 6 Getting rich quick with the Axiom of Choice (2016) (0)
Social Choice and the Mathematics of Manipulation: An Introduction to Manipulability (2005) (0)
The Geometry of Efficient Fair Division: What the IPS and the FIPS Tell Us About Fairness and Efficiency in the General n -Player Context (2005) (0)
Fair division by elections (1996) (0)
More Yes-No Voting (1995) (0)
Fair division: Envy-free procedures for n = 3 and n = 4 (1996) (0)
Other Election-Theoretic Contexts (2005) (0)
Galvin’s Setting: Neutral and Anonymous Predictors (2013) (0)
A Quantitative Version of Carathéodory’s Theorem for Convex Sets (2012) (0)
Fair division: Fair division by auctions (1996) (0)
Fair division: Glossary (1996) (0)
Political Studies Books (2001) (0)
Spherical Harmonic Analysis of Redshift Space Distortions in the IRAS PSCZ Redshift Survey (1998) (0)
The Geometry of Efficient Fair Division: Introduction by Alan D. Taylor (2005) (0)
Diameter of path graphs (2004) (0)

This paper list is powered by the following services:

Other Resources About Alan D. Taylor

en.wikipedia.org

What Schools Are Affiliated With Alan D. Taylor?

Alan D. Taylor is affiliated with the following schools:

Alan D. Taylor's Academic­Influence.com Rankings

Alan D. Taylor's Degrees

Why Is Alan D. Taylor Influential?

Alan D. Taylor's Published Works

Published Works

Other Resources About Alan D. Taylor

What Schools Are Affiliated With Alan D. Taylor?

Alan D. Taylor's AcademicInfluence.com Rankings