paper-with-me

Papers

Escaping Arrow's Theorem: The Advantage-Standard Model

2021-08-02 · Wesley H. Holliday, Mikayla Kelley

There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style impossibility theorems, while remaining in an ordinal preference setting, unless one drastically violates the Independence of Irrelevant Alternatives (IIA). In this paper, we present a more positive outlook. We propose a model of comparing candidates in elections, which we call the Advantage-Standard (AS) model. The requirement that a collective choice rule (CCR) be representable by the AS model captures a key insight of IIA but is weaker than IIA; yet it is stronger than what is known in the literature as weak IIA (two profiles alike on $x,y$ cannot have opposite strict social preferences on $x$ and $y$). In addition to motivating violations of IIA, the AS model makes intelligible violations of another Arrovian assumption: the negative transitivity of the strict social preference relation $P$. While previous literature shows that only weakening IIA to weak IIA or only weakening negative transitivity of $P$ to acyclicity still leads to impossibility theorems, we show that jointly weakening IIA to AS representability and weakening negative transitivity of $P$ leads to no such impossibility theorems. Indeed, we show that several appealing CCRs are AS representable, including even transitive CCRs.

📄 PDF Abstract BibTeX arXiv:2108.01134

Code (0)

등록된 구현이 없습니다.

Tasks

model

Similar Papers 제목 키워드 기반

A Generalization of Arrow's Impossibility Theorem Through Combinatorial Topology

2024-02-08 · Isaac Lara, Sergio Rajsbaum, Armajac Raventós-Pujol

To the best of our knowledge, a complete characterization of the domains that escape the famous Arrow's impossibility theorem remains an open question. We believe that different ways of proving Arrovian theorems illumina…

Distributed Computing

Clarifying Before Reasoning: A Coq Prover with Structural Context

2025-07-03 · Yanzhen Lu, Hanbin Yang, Xiaodie Wang, Ge Zhang 외 arxiv

In this work, we investigate whether improving task clarity can enhance reasoning ability of large language models, focusing on theorem proving in Coq. We introduce a concept-level metric to evaluate task clarity and sho…

Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions

2025-11-12 · Daniel Platnick, Dawson Tomasz, Eamon Earl, Sourena Khanzadeh 외 arxiv

Greedy search methods like Greedy Best-First Search (GBFS) and Enforced Hill-Climbing (EHC) often struggle when faced with Uninformed Heuristic Regions (UHRs) like heuristic local minima or plateaus. In this work, we the…

Escaping the sentence-level paradigm in machine translation

2023-04-25 · Matt Post, Marcin Junczys-Dowmunt

It is well-known that document context is vital for resolving a range of translation ambiguities, and in fact the document setting is the most natural setting for nearly all translation. It is therefore unfortunate that …

de-enMachine TranslationSentenceTranslation

An Automated Theorem Generator with Theoretical Foundation Based on Rectangular Standard Contradiction

2025-11-06 · Yang Xu, Peiyao Liu, Shuwei Chen, Jun Liu arxiv

Currently, there is a lack of rigorous theoretical system for systematically generating non-trivial and logically valid theorems. Addressing this critical gap, this paper conducts research to propose a novel automated th…