Rafael M. Frongillo

Computer Science

[1] RM F, Y Chen, IA Kash. Elicitation for Aggregation. Preprint, 2014.
[ show abstract ] [ pdf ]

[2] RM F, MD Reid. Risk Dynamics in Trade Networks. Preprint, 2014.
[ show abstract ] [ pdf ]

[3] RM F, IA Kash. General Truthfulness Characterizations via Convex Analysis. WINE, 2014.
[ show abstract ] [ pdf ] [ arXiv ] [ talk ] [ poster ]

[4] RM F, IA Kash. Vector-Valued Property Elicitation. Preprint, 2014.
[ show abstract ] [ pdf ]

[5] MD Reid, RM F, RC Williamson, N Mehta. Generalized Mixability via Entropic Duality. Preprint, 2014.
[ show abstract ] [ arXiv ]

[6] M Dudik, RM F, JW Vaughan. Market Making with Decreasing Utility for Information. UAI, 2014.
[ show abstract ] [ arXiv ] [ link ]

[7] J Abernethy, RM F, JW Vaughan, X Li. A General Volume-Parameterized Market Making Framework. EC, 2014.
[ show abstract ] [ pdf ] [ link ]

[8] RM F, MD Reid. Convex Foundations for Generalized MaxEnt Models. MaxEnt, 2013.
[ show abstract ] [ pdf ] [ talk ]

[9] A Wibisono, J Abernethy, P Bartlett, RM F. How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal. NIPS, 2013.
[ show abstract ] [ pdf ] [ link ]

[10] RM F. Eliciting Private Information from Selfish Agents. Ph.D. Thesis, UC Berkeley, 2013.
[ show abstract ] [ printable ] [ compact ]

[11] K Canini, RM F, I Mukherjee, Y Singer. Parallel Boosting with Momentum. ECML, 2013.
[ show abstract ] [ link ]

[12] RM F, N Della Penna, MD Reid. Interpreting prediction markets: a stochastic approach. NIPS, 2012.
[ show abstract ] [ pdf ] [ link ] [ talk ]

[13] J Abernethy, RM F. A Characterization of Scoring Rules for Linear Properties. COLT, 2012.
[ show abstract ] [ pdf ] [ link ] [ talk ]

[14] RM F, J Abernethy, A Wibisono. Minimax Option Pricing Meets Black-Scholes in the Limit. STOC, 2012.
[ show abstract ] [ pdf ] [ link ] [ talk ] [ poster ]

[15] RM F, G Schoenebeck, O Tamuz. Social Learning in a Changing World. WINE, 2011.
[ show abstract ] [ pdf ] [ arXiv ] [ link ]

[16] J Abernethy, RM F. A Collaborative Mechanism for Crowdsourcing Prediction Problems. NIPS, 2011.
[ show abstract ] [ pdf ] [ arXiv ] [ link ] [ poster ]

[17] C Daskalakis, RM F, CH Papadimitriou, G Pierrakos, G Valiant. On learning algorithms for nash equilibria. Algorithmic Game Theory, Springer 2010.
[ show abstract ] [ pdf ] [ link ]

[18] RM F, advised by R. Kleinberg. Online hypergraph matching: hiring teams of secretaries. Masters Thesis, Cornell University, 2008.
[ show abstract ] [ pdf ]

Mathematics

[1] RM F. On the Hardness of State Amalgamation. In preparation.
[ show abstract ]

[2] RM F. Topological entropy bounds for hyperbolic plateaus of the Hénon map. SIAM Undergraduate Research Online, 2014.
[ show abstract ] [ pdf ] [ arXiv ] [ link ]

[3] RM F, R Treviño. Efficient automation of index pairs in computational Conley index theory. SIAM Journal on Applied Dynamical Systems, 11:82-109, 2012.
[ show abstract ] [ pdf ] [ arXiv ] [ link ]

[4] S Day, RM F, R Treviño. Algorithms for rigorous entropy bounds and symbolic dynamics. SIAM Journal on Applied Dynamical Systems, 7:1477-1506, 2008.
[ show abstract ] [ pdf ] [ link ] [ talk ]

[5] RM F, E Lock, DA Brown. Symmetric fractal trees in three dimensions. Chaos Solitons Fractals, Elsevier 32(2):284-295, 2007.
[ show abstract ] [ pdf ] [ link ]