The paper discusses a successive combination jet algorithm for hadron collisions, which is similar to the cone algorithm used in $e^+e^-$ physics. The authors suggest that this algorithm could be useful in hadron collisions, where cone algorithms have been traditionally used. The algorithm defines jets by recursively combining "nearby" pairs of particles or protojets, with the concept of "nearby" measured in $(E_T, \eta, \phi)$ space and involving a limit on angular separations. The authors find that the inclusive jet cross section calculated using this algorithm is essentially identical to the cone algorithm result when the parameters are scaled appropriately. They also present a qualitative argument that the successive combination algorithm may exhibit smaller higher-order and hadronization corrections due to "edge of the cone" effects. The paper concludes by comparing the successive combination algorithm to the cone algorithm in terms of simplicity, definiteness, and the potential for smaller corrections, suggesting that further detailed studies are needed to demonstrate quantitative advantages.The paper discusses a successive combination jet algorithm for hadron collisions, which is similar to the cone algorithm used in $e^+e^-$ physics. The authors suggest that this algorithm could be useful in hadron collisions, where cone algorithms have been traditionally used. The algorithm defines jets by recursively combining "nearby" pairs of particles or protojets, with the concept of "nearby" measured in $(E_T, \eta, \phi)$ space and involving a limit on angular separations. The authors find that the inclusive jet cross section calculated using this algorithm is essentially identical to the cone algorithm result when the parameters are scaled appropriately. They also present a qualitative argument that the successive combination algorithm may exhibit smaller higher-order and hadronization corrections due to "edge of the cone" effects. The paper concludes by comparing the successive combination algorithm to the cone algorithm in terms of simplicity, definiteness, and the potential for smaller corrections, suggesting that further detailed studies are needed to demonstrate quantitative advantages.