Vincent Conitzer
#145,725
Most Influential Person Now
Vincent Conitzer's AcademicInfluence.com Rankings
Vincent Conitzercomputer-science Degrees
Computer Science
#7288
World Rank
#7675
Historical Rank
Artificial Intelligence
#2939
World Rank
#2984
Historical Rank
Database
#4349
World Rank
#4523
Historical Rank
Download Badge
Computer Science
Vincent Conitzer's Degrees
- PhD Computer Science Carnegie Mellon University
Similar Degrees You Can Earn
Why Is Vincent Conitzer Influential?
(Suggest an Edit or Addition)Vincent Conitzer's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Computing the optimal strategy to commit to (2006) (494)
- When are elections with few candidates hard to manipulate? (2007) (357)
- Complexity of Mechanism Design (2002) (307)
- AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents (2003) (297)
- Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness (2011) (260)
- Complexity Results about Nash Equilibria (2002) (253)
- Handbook of Computational Social Choice (2016) (218)
- New complexity results about Nash equilibria (2008) (209)
- A double oracle algorithm for zero-sum security games on graphs (2011) (202)
- Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games (2010) (198)
- Common Voting Rules as Maximum Likelihood Estimators (2005) (181)
- Improved Bounds for Computing Kemeny Rankings (2006) (178)
- Mixed-Integer Programming Methods for Finding Nash Equilibria (2005) (166)
- Preference Functions that Score Rankings and Maximum Likelihood Estimation (2009) (165)
- Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains (2004) (154)
- Communication complexity of common voting rules (2005) (149)
- Vote elicitation: complexity and strategy-proofness (2002) (148)
- Complexity of constructing solutions in the core based on synergies among coalitions (2006) (146)
- Nonexistence of Voting Rules That Are Usually Hard to Manipulate (2006) (142)
- Hide and Seek: Costly Consumer Privacy in a Market with Repeat Purchases (2011) (141)
- Moral Decision Making Frameworks for Artificial Intelligence (2017) (137)
- Determining Possible and Necessary Winners Given Partial Orders (2011) (129)
- Eliciting single-peaked preferences using comparison queries (2007) (127)
- Complexity of manipulating elections with few candidates (2002) (123)
- Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders (2008) (121)
- Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness (2010) (121)
- Decision Theory (2021) (120)
- Generalized scoring rules and the frequency of coalitional manipulability (2008) (118)
- Complexity of unweighted coalitional manipulation under some common voting rules (2009) (114)
- Learning and Approximating the Optimal Strategy to Commit To (2009) (114)
- Fair Public Decision Making (2016) (112)
- Self-interested automated mechanism design and implications for optimal combinatorial auctions (2004) (109)
- Computing Slater Rankings Using Similarities among Candidates (2006) (109)
- Worst-case optimal redistribution of VCG payments in multi-unit auctions (2009) (99)
- Making decisions based on the preferences of multiple agents (2010) (95)
- Barriers to Manipulation in Voting (2016) (90)
- Dominating Manipulations in Voting with Partial Information (2011) (88)
- Security scheduling for real-world networks (2013) (85)
- Coalition Structure Generation Utilizing Compact Characteristic Function Representations (2009) (80)
- Adapting a Kidney Exchange Algorithm to Align with Human Values (2018) (79)
- A sufficient condition for voting rules to be frequently manipulable (2008) (78)
- Multiplicative Pacing Equilibria in Auction Markets (2017) (77)
- Computational criticisms of the revelation principle (2004) (76)
- Computing optimal strategies to commit to in extensive-form games (2010) (76)
- Coalitional Games in Open Anonymous Environments (2005) (74)
- A Maximum Likelihood Approach towards Aggregating Partial Orders (2011) (74)
- How many candidates are needed to make elections hard to manipulate? (2003) (73)
- Complexity of determining nonemptiness of the core (2003) (71)
- Incentive compatible budget elicitation in multi-unit auctions (2009) (68)
- Stackelberg Voting Games: Computational Aspects and Paradoxes (2010) (68)
- Solving Stackelberg games with uncertain observability (2011) (67)
- Combinatorial Auctions with k-wise Dependent Valuations (2005) (67)
- Multi-Step Multi-Sensor Hider-Seeker Games (2009) (66)
- Combinatorial Auctions with Structured Item Graphs (2004) (63)
- Strategy-proof allocation of multiple items between two agents without payments or priors (2010) (63)
- Optimal-in-expectation redistribution mechanisms (2008) (63)
- Security Games with Multiple Attacker Resources (2011) (62)
- Voting on Multiattribute Domains with Cyclic Preferential Dependencies (2008) (62)
- Worst-case optimal redistribution of VCG payments (2007) (60)
- Complexity of (iterated) dominance (2005) (59)
- A scheduling approach to coalitional manipulation (2010) (58)
- Pacing Equilibrium in First-Price Auction Markets (2018) (58)
- Solving Security Games on Graphs via Marginal Probabilities (2013) (56)
- Failures of the VCG mechanism in combinatorial auctions and exchanges (2006) (55)
- Communication complexity as a lower bound for learning in games (2004) (54)
- Commitment to Correlated Strategies (2011) (53)
- Competitive Repeated Allocation without Payments (2009) (52)
- Anonymity-Proof Voting Rules (2008) (52)
- Aggregating preferences in multi-issue domains by using maximum likelihood estimators (2010) (49)
- Computationally Feasible Automated Mechanism Design: General Approach and Case Studies (2010) (47)
- Hypercubewise Preference Aggregation in Multi-Issue Domains (2011) (45)
- Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments (2020) (45)
- Prediction Mechanisms That Do Not Incentivize Undesirable Actions (2009) (44)
- Signaling in Bayesian Stackelberg Games (2016) (44)
- Group Fairness for the Allocation of Indivisible Goods (2019) (44)
- Optimal False-Name-Proof Voting Rules with Costly Voting (2008) (43)
- Finite Local Consistency Characterizes Generalized Scoring Rules (2009) (42)
- Computing Optimal Strategies to Commit to in Stochastic Games (2012) (42)
- Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms (2010) (42)
- Applications of Automated Mechanism Design (2003) (42)
- Computational aspects of preference aggregation (2006) (42)
- Fair and Efficient Social Choice in Dynamic Settings (2017) (40)
- How hard is it to control sequential elections via the agenda (2009) (40)
- A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments (2006) (39)
- Undominated VCG redistribution mechanisms (2008) (38)
- Incremental Mechanism Design (2007) (36)
- Automated mechanism design: complexity results stemming from the single-agent setting (2003) (35)
- An algorithm for automatically designing deterministic mechanisms without payments (2004) (35)
- Better redistribution with inefficient allocation in multi-unit auctions with unit demand (2008) (34)
- Structure-based protein NMR assignments using native structural ensembles (2008) (33)
- Strategic sequential voting in multi-issue domains and multiple-election paradoxes (2011) (33)
- Using Mechanism Design to Prevent False-Name Manipulations (2010) (32)
- Definition and Complexity of Some Basic Metareasoning Problems (2003) (31)
- Comparing multiagent systems research in combinatorial auctions and voting (2010) (30)
- Prediction Markets, Mechanism Design, and Cooperative Game Theory (2009) (30)
- A qualitative vickrey auction (2008) (29)
- Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains (2014) (28)
- Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences (2010) (28)
- False-Name-Proofness in Social Networks (2010) (28)
- Should social network structure be taken into account in elections? (2012) (27)
- Automated Design of Multistage Mechanisms (2007) (27)
- Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments (2008) (26)
- Budget-Balanced and Nearly Efficient Randomized Mechanisms: Public Goods and beyond (2011) (26)
- Undominated Groves Mechanisms (2012) (25)
- Learning algorithms for online principal-agent problems (and selling goods online) (2006) (25)
- Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract) (2004) (25)
- When Do People Want AI to Make Decisions? (2018) (25)
- Computational voting theory: game-theoretic and combinatorial aspects (2011) (24)
- On the Axiomatic Characterization of Runoff Voting Rules (2014) (24)
- Dynamic Proportional Sharing: A Game-Theoretic Approach (2018) (24)
- Limited verification of identities to induce false-name-proofness (2007) (23)
- Expressive negotiation over donations to charities (2004) (23)
- The Revelation Principle for Mechanism Design with Reporting Costs (2016) (23)
- Welfare Undominated Groves Mechanisms (2008) (22)
- Compilation Complexity of Common Voting Rules (2010) (22)
- Proceedings of the 2018 ACM Conference on Economics and Computation (2016) (22)
- False-name-proof matching (2013) (22)
- Introduction to Computational Social Choice (2016) (22)
- Complexity of Scheduling Charging in the Smart Grid (2017) (22)
- Crowdsourcing Societal Tradeoffs (2015) (22)
- The maximum likelihood approach to voting on social networks (2013) (21)
- Fast Equilibrium Computation for Infinitely Repeated Games (2013) (21)
- Computing Game-Theoretic Solutions and Applications to Security (2012) (21)
- A technique for reducing normal-form games to compute a Nash equilibrium (2006) (20)
- On Stackelberg mixed strategies (2016) (20)
- Approximation guarantees for fictitious play (2009) (20)
- A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It (2005) (20)
- General Tiebreaking Schemes for Computational Social Choice (2015) (19)
- Incentive-Aware PAC Learning (2021) (19)
- Strategic Voting and Strategic Candidacy (2015) (18)
- The Exact Computational Complexity of Evolutionarily Stable Strategies (2013) (17)
- A Dutch book against sleeping beauties who are evidential decision theorists (2015) (17)
- Proceedings of the 2016 ACM Conference on Economics and Computation (2016) (16)
- Paradoxes of Multiple Elections: An Approximation Approach (2012) (16)
- Auction protocols (2010) (16)
- Designing Preferences, Beliefs, and Identities for Artificial Intelligence (2019) (15)
- Approximation Algorithm for Security Games with Costly Resources (2011) (15)
- BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games (2003) (15)
- Fair Social Choice in Dynamic Settings (2016) (14)
- An "Ethical" Game-Theoretic Solution Concept for Two-Player Perfect-Information Games (2008) (14)
- On the value of commitment (2014) (14)
- Complexity of Mechanism Design with Signaling Costs (2015) (14)
- False-name-proof voting with costs over two alternatives (2013) (14)
- Coalition structure generation in cooperative games with compact representations (2018) (14)
- Assessing the Robustness of Cremer-McLean with Automated Mechanism Design (2015) (13)
- Online Privacy and Price Discrimination (2010) (13)
- Expressive markets for donating to charities (2011) (13)
- Better redistribution with inefficient allocation in multi-unit auctions (2014) (13)
- When Samples Are Strategically Selected (2019) (12)
- A PAC Framework for Aggregating Agents' Judgments (2019) (12)
- Computing optimal outcomes under an expressive representation of settings with externalities (2012) (12)
- Cooperative Game Solution Concepts that Maximize Stability under Noise (2015) (12)
- An NTU Cooperative Game Theoretic View of Manipulating Elections (2011) (11)
- False-Name-Proof Recommendations in Social Networks (2016) (11)
- Evaluating Resistance to False-Name Manipulations in Elections (2012) (10)
- Game-Theoretic Question Selection for Tests (2013) (10)
- Automated Design of Robust Mechanisms (2017) (10)
- Rules for Choosing Societal Tradeoffs (2016) (10)
- Automated mechanism design for a self-interested designer (2003) (9)
- Proceedings of the fifteenth ACM conference on Economics and computation (2014) (9)
- Choosing fair lotteries to defeat the competition (2012) (9)
- Extracting Money from Causal Decision Theorists (2021) (9)
- Timeability of Extensive-Form Games (2015) (9)
- Mechanism Design for Scheduling with Uncertain Execution Time (2014) (9)
- Maximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility (2016) (9)
- Aggregating value ranges: preference elicitation and truthfulness (2009) (9)
- Using a Memory Test to Limit a User to One Account (2008) (9)
- Metareasoning as a Formal Computational Problem (2011) (8)
- Distinguishing Distributions When Samples Are Strategically Transformed (2019) (8)
- Ethical Implementation of Artificial Intelligence to Select Embryos in In Vitro Fertilization (2021) (8)
- Classification with Strategically Withheld Data (2020) (8)
- Revenue failures and collusion in combinatorial auctions and exchanges with vcg payments (2004) (8)
- Automated Mechanism Design with a Structured Outcome Space (2003) (7)
- False-name-proofness with bid withdrawal (2010) (7)
- Strategic betting for competitive agents (2008) (7)
- Complexity of stability-based solution concepts in multi-issue and MC-net cooperative games (2014) (7)
- Expressive Negotiation in Settings with Externalities (2005) (7)
- Mechanism Design for Correlated Valuations: Efficient Methods for Revenue Maximization (2021) (6)
- A Puzzle about Further Facts (2018) (6)
- Catcher-Evader Games (2016) (6)
- Approximating Common Voting Rules by Sequential Voting in Multi-Issue Domains (2012) (6)
- Can rational choice guide us to correct de se beliefs? (2015) (6)
- Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design (2021) (6)
- Mechanism Design with Unknown Correlated Distributions: Can We Learn Optimal Mechanisms? (2017) (6)
- Computing Stackelberg strategies in stochastic games (2012) (6)
- Tradeoffs in Preventing Manipulation in Paper Bidding for Reviewer Assignment (2022) (5)
- Erratum to: Prediction Mechanisms That Do Not Incentivize Undesirable Actions (2009) (5)
- A Dataset on Malicious Paper Bidding in Peer Review (2022) (5)
- AI Methods in Bioethics (2020) (5)
- Disarmament Games (2017) (5)
- Learning the Valuations of a k-demand Agent (2020) (5)
- Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners) (2016) (5)
- Turing Trade: A Hybrid of a Turing Test and a Prediction Market (2009) (5)
- Automated Dynamic Mechanism Design (2021) (5)
- Computing a Profit-Maximizing Sequence of Offers to Agents in a Social Network (2012) (5)
- Group Fairness for Indivisible Goods Allocation (2019) (4)
- A devastating example for the Halfer Rule (2015) (4)
- Artificial Artificial Intelligence: Measuring Influence of AI 'Assessments' on Moral Decision-Making (2020) (4)
- Minimum-Regret Contracts for Principal-Expert Problems (2020) (4)
- A theory of bounded inductive rationality (2021) (3)
- BOOKS THAT NEED REVIEWERS FOR THE SIGACT NEWS COLUMN Algorithms 1. Distributed Systems: An algorithmic approach (second edition), by Ghosh 2. Tractability: Practical approach to Hard Problems, Edited by Bordeaux, (2012) (3)
- Philosophy in the Face of Artificial Intelligence (2016) (3)
- A multiagent Turing test based on a prediction market (2009) (3)
- Revenue failures and collusion in combinatorial auctions and exchanges with VCG payments (2004) (3)
- ATUCAPTS: Automated Tests that a User Cannot Pass Twice Simultaneously (2016) (3)
- Combinatorial Ski Rental and Online Bipartite Matching (2020) (3)
- Optimal internet auctions with costly communication (2013) (3)
- Decision Scoring Rules (2020) (3)
- The Revelation Principle for Mechanism Design with Signaling Costs (2021) (2)
- Editor's puzzle: borrowing as cheaply as possible (2010) (2)
- Welfare-Preserving ε-BIC to BIC Transformation with Negligible Revenue Loss (2020) (2)
- Dynamic Proportional Sharing (2018) (2)
- Disarmament Games With Resource (2018) (2)
- Editor's puzzle: strategically choosing products to release (2008) (2)
- A Better Algorithm for Societal Tradeoffs (2019) (2)
- Can de se choice be ex ante reasonable in games of imperfect recall? (2022) (2)
- The Personalized A-Theory of Time and Perspective (2020) (2)
- Computational Aspects of Mechanism Design (2005) (2)
- Puzzle: the AI circus: (puzzle in honor of Tuomas Sandholm's 50th birthday) (2020) (2)
- Role Assignment for Game-Theoretic Cooperation (2016) (2)
- Learning Opinions in Social Networks (2020) (2)
- An algorithm for single-agent deterministic automated mechanism design without payments (2003) (2)
- Security games: solution concepts and algorithms (2013) (2)
- Planning with Participation Constraints (2022) (2)
- The ACM transactions on economics and computation: An introduction (2013) (2)
- Establishing Universal Cooperation in Finitely Repeated Games via Limited Altruism (2020) (1)
- Computing Minimax Strategy for Discretized Spatio-Temporal Zero-Sum Security Games ? (2014) (1)
- Eliciting information for decision making from individual and multiple experts (2019) (1)
- Disarmament Games with Resources (2017) (1)
- Computing the Optimal Game (2015) (1)
- Algorithmically Driven Shared Ownership Economies (2019) (1)
- Crying about a Strategic Wolf: A Theory of Crime and Warning (2020) (1)
- Dynamic Proportional Sharing: A Game-Theoretic Approach (2019) (1)
- Strategy-proof contract auctions and the role of ties (2011) (1)
- Indecision Modeling (2020) (1)
- For Learning in Symmetric Teams, Local Optima are Global Nash Equilibria (2022) (1)
- 10101 Executive Summary - Computational Foundations of Social Choice (2010) (1)
- Bayesian Repeated Zero-Sum Games with Persistent State, with Application to Security Games (2020) (1)
- Similarity-based Cooperation (2022) (1)
- Maximal Cooperation in Repeated Games on Social Networks (2015) (1)
- Editor's puzzle: combinatorial auction winner determination (2007) (1)
- Editor's puzzle: identifying the champion (2009) (1)
- A New Solution Concept for Coalitional Games in Open Anonymous Environments (2006) (1)
- Editor's puzzle: a dutch dutch auction clock auction (2009) (1)
- Social Choice and Welfare Justified Representation in Approval-Based Committee Voting (2016) (1)
- Boy Cries Wolf: Warnings About a Strategic Adversary (2016) (1)
- Pacing Equilibrium in First Price Auction Markets (2022) (1)
- How Much Moral Status Could Artificial Intelligence Ever Achieve? (2021) (1)
- Nash Welfare and Round Robin Share (2016) (0)
- Choosing fair lotteries to defeat the competition (2011) (0)
- 2 Review : Shaw ’ s Waking Game (2018) (0)
- AAAI 2008 Workshop Reports (2009) (0)
- Conference Organizing Committee (2021) (0)
- Statement of Interest for Bayesian Modeling Applications Workshop : Applications of Automated Mechanism Design ∗ (0)
- Editor's introduction (2008) (0)
- A Puzzle about Further Facts (2018) (0)
- A devastating example for the Halfer Rule (2014) (0)
- Should Stackelberg Mixed Strategies Be Considered a Separate Solution Concept ? (2014) (0)
- Justified representation in approval-based committee voting (2017) (0)
- Optimization in Multi-Issue Negotiation Settings with Externalities ? (0)
- Lecture notes 7 : Network flow problems (2010) (0)
- Lecture notes ? : An illustrative example : the core and network flow (2008) (0)
- An Undergraduate Course in the Intersection of Computer Science and Economics (2012) (0)
- Efficient Algorithms for Computing Stackelberg Strategies in Security Games (2012) (0)
- Role Assignment for Game-Theoretic Cooperation: (Extended Abstract) (2016) (0)
- Editor's introduction (2008) (0)
- Introduction to the Special Issue on EC'14 (2016) (0)
- Technical perspective: Designing algorithms and the fairness criteria they should satisfy (2018) (0)
- Notes from the EC'14 program chairs (2014) (0)
- Discussion of "A conditional game for comparing approximations" (2011) (0)
- Towards a General Theory of False-Name-Proof Mechanisms with Costs I (2009) (0)
- On Stackelberg mixed strategies (2015) (0)
- Technical Perspective: The Impact of Auditing for Algorithmic Bias (2022) (0)
- Editor's introduction (2009) (0)
- Using Human Subjects ’ Judgments for Automated Moral Decision Making (2017) (0)
- Invited talk by winner of IFAAMAS Victor Lesser Distinguished Dissertation Award (2007) (0)
- Editor's introduction (2010) (0)
- Computational Foundations of Social Choice 3 Data reduction and problem kernels for voting problems (2010) (0)
- 1 Formulating the Problem as a Linear Program (2018) (0)
- Lecture notes 5: Duality in applications (2008) (0)
- Munich Personal RePEc Archive Choosing Fair Lotteries to Defeat the Competition (2019) (0)
- Proceedings of the 12th workshop on the Economics of Networks, Systems and Computation (2017) (0)
- Intellectual development statement (2010) (0)
- Learning Influence Adoption in Heterogeneous Networks (2022) (0)
- Editor's puzzle: product adoption in a social network (2008) (0)
- M A ] 12 S ep 2 01 6 Justified Representation in Approval-Based Committee Voting (2021) (0)
- Incrementally Making Mechanisms More Strategy-Proof (0)
- Editor's introduction (2009) (0)
- SLEEPING BEAUTY (2021) (0)
- Puzzle (2019) (0)
- Using Human Cognitive Limitations to Enable New Systems (2020) (0)
- On the value of commitment (2013) (0)
- Farewell Editorial (2017) (0)
- Selective Obfuscation for Fairness, Privacy, and Beyond (2020) (0)
- Bottlenecks and Regret (2013) (0)
- Can rational choice guide us to correct de se beliefs? (2015) (0)
- Eliciting information for decision making (2020) (0)
- Can Artificial Intelligence Do Everything That We Can? (2018) (0)
- A Dutch book against sleeping beauties who are evidential decision theorists (2015) (0)
- Editor's introduction (2007) (0)
- Complexity of Iterated Dominance and a New Definition of Eliminability (2004) (0)
- Beat the Cheater: Computing Game-Theoretic Strategies for When to Kick a Gambler out of a Casino (2014) (0)
- Paper Submissions for COMSOC-2012 (2010) (0)
- Foundations of Cooperative AI (2022) (0)
- Computing Game-Theoretic Solutions for Security in the Medium Term (2018) (0)
- Lecture notes 2 : Applications (2008) (0)
- Automated Mechanism Design for Strategic Classification: Abstract for KDD'21 Keynote Talk (2021) (0)
- Framing Matters : Sanctioning in Public Good Games with Parallel Bilateral Relationships ∗ (2017) (0)
- Computing Equilibria with Partial Commitment (2016) (0)
- Bayesian-Incentive Compatible Transformations without Welfare Loss (2020) (0)
- Bayesian Networks (2021) (0)
- False-name-proof voting with costs over two alternatives (2014) (0)
- AI and Economic Theory (2011) (0)
- 10101 Abstracts Collection - Computational Foundations of Social Choice (2010) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Vincent Conitzer?
Vincent Conitzer is affiliated with the following schools:
