If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
This paper concentrates on some aspects of the history of the analytic-synthetic distinction from Kant to Bolzano and Frege. This history evinces considerable continuity but also ...
We consider the decentralized power allocation and spectrum sharing problem in multi-user, multichannel systems with strategic users. We present a mechanism/game form that has the...
A model for statistical ranking is a family of probability distributions whose states are orderings of a xed nite set of items. We represent the orderings as maximal chains in a ...