Grant Schoenebeck

According to our database1, Grant Schoenebeck authored at least 42 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
An Information Theoretic Framework For Designing Information Elicitation Mechanisms That Reward Truth-telling.
ACM Trans. Economics and Comput., 2019

Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

The Volatility of Weak Ties: Co-evolution of Selection and Influence in Social Networks.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Contention-Aware Lock Scheduling for Transactional Databases.
PVLDB, 2018

Consensus of Interacting Particle Systems on Erdös-Rényi Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Eliciting Expertise without Verification.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Water from Two Rocks: Maximizing the Mutual Information.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice Case.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionality.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
How Complex Contagions Spread Quickly in Preferential Attachment Models and Other Time-Evolving Networks.
IEEE Trans. Network Science and Engineering, 2017

Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Cascades and Myopic Routing in Nonhomogeneous Kleinberg's Small World Model.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Don't Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

A Top-Down Approach to Achieving Performance Predictability in Database Systems.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Engineering Agreement: The Naming Game with Asymmetric and Heterogeneous Agents.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Complex Contagions on Configuration Model Graphs with a Power-Law Degree Distribution.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Putting Peer Prediction Under the Micro(economic)scope and Making Truth-Telling Focal.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Sybil Detection Using Latent Network Structure.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

General Threshold Model for Social Cascades: Analysis and Simulations.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Complex Contagions in Kleinberg's Small World Model.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Better Approximation Algorithms for the Graph Diameter.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Characterizing strategic cascades on networks.
Proceedings of the ACM Conference on Economics and Computation, 2014

Buying private data without verification.
Proceedings of the ACM Conference on Economics and Computation, 2014

2013
Potential networks, contagious communities, and understanding social network structure.
Proceedings of the 22nd International World Wide Web Conference, 2013

2012
Conducting truthful surveys, cheaply.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Finding overlapping communities in social networks: toward a rigorous approach.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Social Learning in a Changing World.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

General Hardness Amplification of Predicates and Puzzles - (Extended Abstract).
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010
Limitations of Linear and Semidefinite Programs.
PhD thesis, 2010

Detecting Spam in a Twitter Network.
First Monday, 2010

Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Reaching Consensus on Social Networks.
Proceedings of the Innovations in Computer Science, 2010

Optimal Testing of Reed-Muller Codes.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
On the complexity of Nash equilibria of action-graph games.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Linear Level Lasserre Lower Bounds for Certain k-CSPs.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006
The computational complexity of nash equilibria in concisely represented games.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

CHORA: Expert-Based P2P Web Search.
Proceedings of the Agents and Peer-to-Peer Computing - 5th International Workshop, 2006

2005
The Computational Complexity of Nash Equilibria in Concisely Represented Games
Electronic Colloquium on Computational Complexity (ECCC), 2005

2004
GROWRANGE: Anytime VCG-Based Mechanisms.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004


  Loading...