Shneidman, Jeffrey
Bibliographic References tagged with Shneidman, Jeffrey
Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
B. Lubin, A. I. Juda, R. Cavallo, S. Lahaie, J. Shneidman, and D. C. Parkes,
“ICE: An Expressive Iterative Combinatorial Exchange.”, in Handbook of Spectrum Auction Design, vol. 39, Cambidge University Press, 2017, pp. 828–873.
B. Lubin, A. I. Juda, R. Cavallo, S. Lahaie, J. Shneidman, and D. C. Parkes,
“ICE: An Expressive Iterative Combinatorial Exchange.”, in Handbook of Spectrum Auction Design, vol. 39, Cambidge University Press, 2017, pp. 828–873.
J. Shneidman and D. C. Parkes,
“Rationality and Self-Interest in Peer to Peer Networks”, in 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003, pp. 139–148.
J. Shneidman and D. C. Parkes,
“Rationality and Self-Interest in Peer to Peer Networks”, in 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003, pp. 139–148.
J. Shneidman and D. C. Parkes,
“Using Redundancy to Improve Robustness of Distributed Mechanism Implementations”, in Fourth ACM Conf. on Electronic Commerce (EC’03), 2003, pp. 276–277.
J. Shneidman and D. C. Parkes,
“Using Redundancy to Improve Robustness of Distributed Mechanism Implementations”, in Fourth ACM Conf. on Electronic Commerce (EC’03), 2003, pp. 276–277.
B. Lubin, A. I. Juda, R. Cavallo, S. Lahaie, J. Shneidman, and D. C. Parkes,
“ICE: An Expressive Iterative Combinatorial Exchange”, Journal of Artificial Intelligence Research, vol. 33, pp. 33–77, 2008.
B. Lubin, A. I. Juda, R. Cavallo, S. Lahaie, J. Shneidman, and D. C. Parkes,
“ICE: An Expressive Iterative Combinatorial Exchange”, Journal of Artificial Intelligence Research, vol. 33, pp. 33–77, 2008.
R. Cavallo et al.,
“TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges”, in Multidisciplinary Workshop on Advances in Preference Handling (IJCAI), 2005.
R. Cavallo et al.,
“TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges”, in Multidisciplinary Workshop on Advances in Preference Handling (IJCAI), 2005.
B. Faltings, D. C. Parkes, A. Petcu, and J. Shneidman,
“Optimizing Streaming Applications with Self-Interested Users using MDPOP”, in Proc. International Workshop on Computational Social Choice (COMSOC’06), Amsterdam, The Netherlands, 2006.
B. Faltings, D. C. Parkes, A. Petcu, and J. Shneidman,
“Optimizing Streaming Applications with Self-Interested Users using MDPOP”, in Proc. International Workshop on Computational Social Choice (COMSOC’06), Amsterdam, The Netherlands, 2006.
J. Shneidman et al.,
“Why Markets Could (But Don’t Currently) Solve Resource Allocation Problems in Systems”, in Proc. 10th Workshop on Hot Topics in Operating Systems (HotOS-X), Santa Fe, NM, 2005.
J. Shneidman et al.,
“Why Markets Could (But Don’t Currently) Solve Resource Allocation Problems in Systems”, in Proc. 10th Workshop on Hot Topics in Operating Systems (HotOS-X), Santa Fe, NM, 2005.
D. C. Parkes and J. Shneidman,
“Distributed Implementations of Vickrey-Clarke-Groves Mechanisms”, in Proc. 3rd Int. Joint Conf. on Autonomous Agents and Multi Agent Systems, 2004, pp. 261–268.
D. C. Parkes and J. Shneidman,
“Distributed Implementations of Vickrey-Clarke-Groves Mechanisms”, in Proc. 3rd Int. Joint Conf. on Autonomous Agents and Multi Agent Systems, 2004, pp. 261–268.
J. Shneidman, D. C. Parkes, and L. Massoulie,
“Faithfulness in Internet Algorithms”, in Proc. SIGCOMM Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems (PINS’04), Portland, USA, 2004, pp. 220–227.
J. Shneidman, D. C. Parkes, and L. Massoulie,
“Faithfulness in Internet Algorithms”, in Proc. SIGCOMM Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems (PINS’04), Portland, USA, 2004, pp. 220–227.
J. Shneidman and D. C. Parkes,
“Specification Faithfulness in Networks with Rational Nodes”, in Proc. 23rd ACM Symp. on Principles of Distributed Computing (PODC’04), St. John’s, Canada, 2004, pp. 88–97.
J. Shneidman and D. C. Parkes,
“Specification Faithfulness in Networks with Rational Nodes”, in Proc. 23rd ACM Symp. on Principles of Distributed Computing (PODC’04), St. John’s, Canada, 2004, pp. 88–97.