0101011010100111111111010001010011011010
0010101001110101001000100100010101110111
0101000101111110010111000001101010000111
0111111001000010101000111000101010100100
1110110000100000110010000010111101000100
0011100000000110000100001011010111100111
1111010010010110111110010001000010001101
0110001011111011110010011101010100010101
0100010011010001101101110001000000000110
0110001111001001001011000101011001110000
0111011000011001000110011001111001010100
1010100000110100101000110010110010110111
0100111100011111001001010111001000111101
0000011011010010011100001111110010110110
0110011001100010111111101111100011000010
1001010111111101011001001010001011110110
0111100010110011110000011110011010111101
1101101100110101100110111110010000000111
0111001000001100110111111001101111100011

Jeffrey Shneidman

Maxwell Dworkin 121
33 Oxford Street
Harvard University, 02138
Best Contact Phone (Mobile):

Graduate student in Systems Research at Harvard and the Economics and Computer Science research groups.


Refereed Publications

Ordered by subject, and then reverse chronological.

Computational Market Design
Faithfulness and Rational Failure

Stream Based Overlay Networks

Other Published Work
Unpublished Papers
Released Software

Click here to go to JOpt.

JOpt is an open source Java wrapper that provides objects like Variable, Constraint, and Term and lets you express your linear or mixed integer programs in a natural manner, while remaining agnostic to the details of the solver backend. JOpt is not a solver. Rather, it requires a solver such as CPlex or the free LPSolve to operate. In the future, we aim to provide backend support for at least one free solver, such as hooks into the GNU Linear Programming Kit, etc. This means that any program written with JOpt will work regardless of the solver actually licensed or downloaded by the end user.