Grant Schoenebeck

Orcid: 0000-0001-6878-0670

Affiliations:
  • University of Michigan, USA


According to our database1, Grant Schoenebeck authored at least 77 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Spot Check Equivalence: An Interpretable Metric for Information Elicitation Mechanisms.
Proceedings of the ACM on Web Conference 2024, 2024

Exit Ripple Effects: Understanding the Disruption of Socialization Networks Following Employee Departures.
Proceedings of the ACM on Web Conference 2024, 2024

Filter Bubble or Homogenization? Disentangling the Long-Term Effects of Recommendations on User Consumption Patterns.
Proceedings of the ACM on Web Conference 2024, 2024

Eliciting Informative Text Evaluations with Large Language Models.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Eliciting Honest Information from Authors Using Sequential Review.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
High-Effort Crowds: Limited Liability via Tournaments.
Proceedings of the ACM Web Conference 2023, 2023

Multitask Peer Prediction With Task-dependent Strategies.
Proceedings of the ACM Web Conference 2023, 2023

Testing conventional wisdom (of the crowd).
Proceedings of the Uncertainty in Artificial Intelligence, 2023

The Wisdom of Strategic Voting.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Measurement Integrity in Peer Prediction: A Peer Assessment Case Study.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

False Consensus, Information Theory, and Prediction Markets.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Two Strongly Truthful Mechanisms for Three Heterogeneous Agents Answering One Question.
ACM Trans. Economics and Comput., December, 2022

Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization.
J. Artif. Intell. Res., 2022

Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization.
Inf. Comput., 2022

BONUS! Maximizing Surprise.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

A System-Level Analysis of Conference Peer Review.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Optimal Local Bayesian Differential Privacy over Markov Chains.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Survey Equivalence: A Procedure for Measuring Classifier Accuracy Against Human Labels.
CoRR, 2021

Information Elicitation from Rowdy Crowds.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Bayesian Persuasion in Sequential Trials.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Learning and Strongly Truthful Multi-Task Peer Prediction: A Variational Approach.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Relaxing Common Belief for Social Networks.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

SURPRISE! and When to Schedule It.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Timely Information from Prediction Markets.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Influence Maximization on Undirected Graphs: Toward Closing the (1-1/e) Gap.
ACM Trans. Economics and Comput., 2020

Escaping Saddle Points in Constant Dimensional Spaces: An Agent-based Modeling Perspective.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Limitations of Greed: Influence Maximization in Undirected Networks Re-visited.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Information Elicitation Mechanisms for Statistical Estimation.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization.
ACM Trans. Comput. Theory, 2019

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

Outsourcing Computation: The Minimal Refereed Mechanism.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Social learning with questions.
Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation, 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.
Proc. VLDB Endow., 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. Netw. Sci. Eng., 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
A Framework For Designing Information Elicitation Mechanisms That Reward Truth-telling.
CoRR, 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
Graph Isomorphism and the Lasserre Hierarchy.
CoRR, 2014

How Complex Contagions Spread and Spread Quickly.
CoRR, 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

General Hardness Amplification of Predicates and Puzzles
CoRR, 2010

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

Optimal Testing of Reed-Muller Codes.
Proceedings of the Property Testing - Current Research and Surveys, 2010

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

2009
Optimal testing of Reed-Muller codes.
Electron. Colloquium Comput. Complex., 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

2006
Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut.
Electron. Colloquium Comput. Complex., 2006

A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
Electron. Colloquium Comput. Complex., 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
Electron. Colloquium Comput. Complex., 2005

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


  Loading...