Arrow Research search

Author name cluster

Eric Pacuit

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

18 papers
2 author rows

Possible papers

18

AAAI Conference 2026 Conference Paper

Stable Voting and the Splitting of Cycles

  • Wesley H. Holliday
  • Milan Mossé
  • Chase Norman
  • Eric Pacuit
  • Cynthia Wang

Algorithms for resolving majority cycles in preference aggregation have been studied extensively in computational social choice. Several sophisticated cycle-resolving methods, including Tideman's Ranked Pairs, Schulze's Beat Path, and Heitzig's River, are refinements of the Split Cycle (SC) method that resolves majority cycles by discarding the weakest majority victories in each cycle. Recently, Holliday and Pacuit proposed a new refinement of Split Cycle, dubbed Stable Voting, and a simplification thereof, called Simple Stable Voting (SSV). They conjectured that SSV is a refinement of SC whenever no two majority victories are of the same size. In this paper, we prove the conjecture up to 6 alternatives and refute it for more than 6 alternatives. While our proof of the conjecture for up to 5 alternatives uses traditional mathematical reasoning, our 6-alternative proof and 7-alternative counterexample were obtained with the use of SAT solving. The SAT encoding underlying this proof and counterexample is applicable far beyond SC and SSV: it can be used to test properties of any voting method whose choice of winners depends only on the ordering of margins of victory by size.

TARK Conference 2025 Conference Paper

Common p-Belief with Plausibility Measures: Extended Abstract

  • Eric Pacuit
  • Leo Yang

Aumann's famous Agreeing to Disagree Theorem states that if a group of agents share a common prior, update their beliefs by Bayesian conditioning based on private information, and have common knowledge of their posterior beliefs regarding some event, these posteriors must be identical. There is an elegant generalization of this theorem by Monderer and Samet, later refined by Neeman: if a group of agents share a common prior, update their beliefs using Bayesian conditioning on private information, and have common p-belief of their posteriors, these posteriors must be close (i. e. , they cannot differ by more than 1 - p). Here, common p-belief generalizes the concept of common knowledge to probabilistic beliefs: agents commonly p-believe an event E if everyone believes E to at least degree p, everyone believes to at least degree p that everyone believes E to at least degree p, and so on. This paper further extends the Monderer-Samet-Neeman Agreement Theorem from classical probability measures to plausibility measures -- a very general framework introduced by Halpern that unifies many formal models of belief. To facilitate this extension, we provide a new proof of the Monderer-Samet-Neeman theorem in the classical setting. Building upon both the original proof and our new proof, we offer two different generalizations of the theorem to plausibility-based structures. We then apply these generalized results to several non-classical belief models, including conditional probability structures and lexicographic probability structures. Moreover, we show that whenever our generalized theorems do not apply, the Monderer-Samet-Neeman Agreement Theorem fails. These findings suggest that our results successfully identify the minimal conditions required for a belief model to satisfy the Monderer-Samet-Neeman Agreement Theorem.

AAAI Conference 2025 Conference Paper

Learning to Manipulate Under Limited Information

  • Wesley H. Holliday
  • Alexander Kristoffersen
  • Eric Pacuit

By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to such strategic manipulation has become a key consideration for comparing voting methods. Here we measure resistance to manipulation by whether neural networks of varying sizes can learn to profitably manipulate a given voting method in expectation, given different types of limited information about how other voters will vote. We trained over 100,000 neural networks of 26 sizes to manipulate against 8 different voting methods, under 6 types of limited information, in committee-sized elections with 5-21 voters and 3-6 candidates. We find that some voting methods, such as Borda, are highly manipulable by networks with limited information, while others, such as Instant Runoff, are not, despite being quite profitably manipulated by an ideal manipulator with full information. For the three probability models for elections that we use, the overall least manipulable of the 8 methods we study are Condorcet methods, namely Minimax and Split Cycle.

ICML Conference 2024 Conference Paper

Position: Social Choice Should Guide AI Alignment in Dealing with Diverse Human Feedback

  • Vincent Conitzer
  • Rachel Freedman
  • Jobst Heitzig
  • Wesley H. Holliday
  • Bob M. Jacobs
  • Nathan O. Lambert
  • Milan Mossé
  • Eric Pacuit

Foundation models such as GPT-4 are fine-tuned to avoid unsafe or otherwise problematic behavior, such as helping to commit crimes or producing racist text. One approach to fine-tuning, called reinforcement learning from human feedback, learns from humans’ expressed preferences over multiple outputs. Another approach is constitutional AI, in which the input from humans is a list of high-level principles. But how do we deal with potentially diverging input from humans? How can we aggregate the input into consistent data about “collective” preferences or otherwise use it to make collective choices about model behavior? In this paper, we argue that the field of social choice is well positioned to address these questions, and we discuss ways forward for this agenda, drawing on discussions in a recent workshop on Social Choice for AI Ethics and Safety held in Berkeley, CA, USA in December 2023.

TARK Conference 2021 Conference Paper

Measuring Violations of Positive Involvement in Voting

  • Wesley H. Holliday
  • Eric Pacuit

In the context of computational social choice, we study voting methods that assign a set of winners to each profile of voter preferences. A voting method satisfies the property of positive involvement (PI) if for any election in which a candidate x would be among the winners, adding another voter to the election who ranks x first does not cause x to lose. Surprisingly, a number of standard voting methods violate this natural property. In this paper, we investigate different ways of measuring the extent to which a voting method violates PI, using computer simulations. We consider the probability (under different probability models for preferences) of PI violations in randomly drawn profiles vs. profile-coalition pairs (involving coalitions of different sizes). We argue that in order to choose between a voting method that satisfies PI and one that does not, we should consider the probability of PI violation conditional on the voting methods choosing different winners. We should also relativize the probability of PI violation to what we call voter potency, the probability that a voter causes a candidate to lose. Although absolute frequencies of PI violations may be low, after this conditioning and relativization, we see that under certain voting methods that violate PI, much of a voter's potency is turned against them - in particular, against their desire to see their favorite candidate elected.

LORI Conference 2021 Conference Paper

Voting Theory in the Lean Theorem Prover

  • Wesley H. Holliday
  • Chase Norman
  • Eric Pacuit

Abstract There is a long tradition of fruitful interaction between logic and social choice theory. In recent years, much of this interaction has focused on computer-aided methods such as SAT solving and interactive theorem proving. In this paper, we report on the development of a framework for formalizing voting theory in the Lean theorem prover, which we have applied to verify properties of a recently studied voting method. While previous applications of interactive theorem proving to social choice (using Isabelle/HOL and Mizar) have focused on the verification of impossibility theorems, we aim to cover a variety of results ranging from impossibility theorems to the verification of properties of specific voting methods (e. g. , Condorcet consistency, independence of clones, etc.). In order to formalize voting theoretic axioms concerning adding or removing candidates and voters, we work in a variable-election setting whose formalization makes use of dependent types in Lean.

TARK Conference 2019 Conference Paper

Strategic Voting Under Uncertainty About the Voting Method

  • Wesley H. Holliday
  • Eric Pacuit

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting method. A growing body of literature explores strategic voting when there is uncertainty about how others will vote. In this paper, we study strategic voting when there is uncertainty about the voting method. We introduce three notions of manipulability for a set of voting methods: sure, safe, and expected manipulability. With the help of a computer program, we identify voting scenarios in which uncertainty about the voting method may reduce or even eliminate a voter's incentive to misrepresent her preferences. Thus, it may be in the interest of an election designer who wishes to reduce strategic voting to leave voters uncertain about which of several reasonable voting methods will be used to determine the winners of an election.

TARK Conference 2013 Conference Paper

When is an example a counterexample?

  • Eric Pacuit
  • Arthur Paul Pedersen
  • Jan-Willem Romeijn

sequence of input beliefs [8, 9, 5, 15, 16, 18, 21, 6]. Two postulates which have been extensively discussed in the literature are the following constraints: In this extended abstract, we carefully examine a purported counterexample to a postulate of iterated belief revision. We suggest that the example is better seen as a failure to apply the theory of belief revision in sufficient detail. The main contribution is conceptual aiming at the literature on the philosophical foundations of the AGM theory of belief revision [1]. Our discussion is centered around the observation that it is often unclear whether a specific example is a “genuine” counterexample to an abstract theory or a misapplication of that theory to a concrete case. 1. I1 If ψ ∈ Cn({ϕ}) then (K ∗ ψ) ∗ ϕ = K ∗ ϕ I2 If ¬ψ ∈ Cn({ϕ}) then (K ∗ ϕ) ∗ ψ = K ∗ ψ Each of these postulates have some intuitive appeal. Postulate I1 demands if ϕ → ψ is a theorem (with respect to the background theory), then first learning ψ followed by the more specific information ϕ is equivalent to directly learning the more specific information ϕ. Postulate I2 demands that first learning ϕ followed by learning a piece of information ψ incompatible with ϕ is the same as simply learning ψ outright. So, for example, first learning ϕ and then ¬ϕ should result in the same belief state as directly learning ¬ϕ. 2 Many recent developments in this area have been offered on the basis of analyses of concrete examples. These range from toy examples—such as the infamous muddy children puzzle, the Monty Hall problem, and the Judy Benjamin problem—to everyday examples of social interaction. Different frameworks are then judged, in part, on how well they conform to the analyst’s intuitions about the perceived relevant set of examples. This raises an important issue: Implicit assumptions about what the agents know and believe about the situation being modeled often guide the analyst’s intuitions. In many cases, it is crucial to make these underlying assumptions explicit. The following simple example illustrates the type of implicit assumption that we have in mind. There are two opaque boxes, labeled 1 and 2, each containing a coin. The believer is interested in the status of the coins in each box. Suppose that Ann is an expert on the status (heads up or tails up) of the coin in box 1 and that Bob is an expert on the status (heads up or tails up) of the coin in box 2. Currently the believer under consideration does not have an opinion about whether the coins are lying heads up or tails up in the boxes; more specifically, the believer thinks that all four possibilities are equally plausible. Suppose that both Ann and Bob report that their respective coins are lying tails

LORI Conference 2011 Conference Paper

A Dynamic Analysis of Interactive Rationality

  • Eric Pacuit
  • Olivier Roy

Abstract Epistemic game theory has shown the importance of informational contexts in understanding strategic interaction. We propose a general framework to analyze how such contexts may arise. The idea is to view informational contexts as the fixed-points of iterated, “rational responses” to incoming information about the agents’ possible choices. We show general conditions for the stabilization of such sequences of rational responses, in terms of structural properties of both the decision rule and the information update policy.

LORI Conference 2011 Conference Paper

DEL Planning and Some Tractable Cases

  • Benedikt Löwe
  • Eric Pacuit
  • Andreas Witzel

Abstract We describe the planning problem within the framework of dynamic epistemic logic (DEL), considering the tree of sequences of events as the underlying structure. In general, the DEL planning problem is computationally difficult to solve. On the other hand, a great deal of fruitful technical advances have led to deep insights into the way DEL works, and these can be exploited in special cases. We present a few properties that will lead to considerable simplifications of the DEL planning problem and apply them in a toy example.

LORI Conference 2011 Conference Paper

Logical Dynamics of Evidence

  • Johan van Benthem
  • Eric Pacuit

Abstract Evidence is the underpinning of beliefs and knowledge. Modeling evidence for an agent requires a more fine-grained semantics than possible worlds models. We do this in the form of “neighbourhood models”, originally proposed for weak modal logics. We show how these models support natural actions of “evidence management”, ranging from update with external new information to internal rearrangement. This perspective leads to richer languages for neighborhood semantics, including modalities for new kinds of conditional evidence and conditional belief. Using these, we indicate how one can obtain relative completeness theorems for the dynamic logic of evidence-changing actions.

KR Conference 2010 Conference Paper

Joint revision of belief and intention

  • Thomas Icard
  • Eric Pacuit
  • Yoav Shoham

1. The agent makes some observation, e. g. from sensory inWe present a formal semantical model to capture action, belief and intention, based on the “database perspective” (Shoham 2009). We then provide postulates for belief and intention revision, and state a representation theorem relating our postulates to the formal model. Our belief postulates are in the spirit of the AGM theory; the intention postulates stand in rough correspondence with the belief postulates. Motivation

JELIA Conference 2006 Conference Paper

Modal Logics of Negotiation and Preference

  • Ulle Endriss
  • Eric Pacuit

Abstract We develop a dynamic modal logic that can be used to model scenarios where agents negotiate over the allocation of a finite number of indivisible resources. The logic includes operators to speak about both preferences of individual agents and deals regarding the reallocation of certain resources. We reconstruct a known result regarding the convergence of sequences of mutually beneficial deals to a Pareto optimal allocation of resources, and discuss the relationship between reasoning tasks in our logic and problems in negotiation. For instance, checking whether a given restricted class of deals is sufficient to guarantee convergence to a Pareto optimal allocation for a specific negotiation scenario amounts to a model checking problem; and the problem of identifying conditions on preference relations that would guarantee convergence for a restricted class of deals under all circumstances can be cast as a question in modal logic correspondence theory.

TARK Conference 2005 Conference Paper

First-order classical modal logic: applications in logics of knowledge and probability

  • Horacio L. Arló-Costa
  • Eric Pacuit

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (like FOL + K) in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. We conclude by offering a general completeness result for the entire family of first order classical modal logics (encompassing both normal and non-normal systems).

JELIA Conference 2004 Conference Paper

Knowledge-Theoretic Properties of Strategic Voting

  • Samir Chopra
  • Eric Pacuit
  • Rohit Parikh

Abstract Results in social choice theory such as the Arrow and Gibbard-Satterthwaite theorems constrain the existence of rational collective decision making procedures in groups of agents. The Gibbard-Satterthwaite theorem says that no voting procedure is strategy-proof. That is, there will always be situations in which it is in a voter’s interest to misrepresent its true preferences i. e. , vote strategically. We present some properties of strategic voting and then examine – via a bimodal logic utilizing epistemic and strategizing modalities – the knowledge-theoretic properties of voting situations and note that unless the voter knows that it should vote strategically, and how, i. e. , knows what the other voters’ preferences are and which alternate preference P ′ it should use, the voter will not strategize. Our results suggest that opinion polls in election situations effectively serve as the first n –1 stages in an n stage election.

KR Conference 2004 Conference Paper

Majority Logic

  • Eric Pacuit
  • Samer Salame

We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness proofs. Along the way, we must answer the question what is a majority of an infinite set? Majority spaces are introduced as a solution to this question.