English
Related papers

Related papers: Random Dictators with a Random Referee: Constant S…

200 papers

The utilitarian distortion framework evaluates voting rules by their worst-case efficiency loss when voters have cardinal utilities but express only ordinal rankings. Under the classical model, a longstanding tension exists: Plurality,…

Computer Science and Game Theory · Computer Science 2026-02-12 Hamidreza Alipour , Mohak Goyal

We show how rate-distortion theory provides a mechanism for automated theory building by naturally distinguishing between regularity and randomness. We start from the simple principle that model variables should, as much as possible, render…

Data Analysis, Statistics and Probability · Physics 2016-09-08 Susanne Still , James P. Crutchfield

We study the connection between the order of phase transitions in combinatorial problems and the complexity of decision algorithms for such problems. We rigorously show that, for a class of random constraint satisfaction problems, a limited…

Computational Complexity · Computer Science 2007-05-23 Gabriel Istrate , Stefan Boettcher , Allon G. Percus

Serial dictatorship is a simple mechanism for coordinating agents in solving combinatorial optimization problems according to their preferences. The most representative such problem is one-sided matching, in which a set of n agents have…

Computer Science and Game Theory · Computer Science 2024-07-08 Ioannis Caragiannis , Kurt Mehlhorn , Nidhi Rathi

We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share the ownership of the resources to be distributed. Examples might include seats in public schools, faculty offices, and time…

Theoretical Economics · Economics 2021-09-07 Mustafa Oğuz Afacan , Inácio Bó

Double descent refers to the phase transition that is exhibited by the generalization error of unregularized learning models when varying the ratio between the number of parameters and the number of training samples. The recent success of…

Machine Learning · Computer Science 2020-06-19 Michał Dereziński , Feynman Liang , Michael W. Mahoney

Peer reviews, evaluations, and selections are a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals from those submitted for funding. The problem of peer selection,…

Computer Science and Game Theory · Computer Science 2019-05-01 Haris Aziz , Omer Lev , Nicholas Mattei , Jeffrey S. Rosenschein , Toby Walsh

Chance constrained programming (CCP) refers to a type of optimization problem with uncertain constraints that are satisfied with at least a prescribed probability level. In this work, we study the sample average approximation (SAA) of…

Optimization and Control · Mathematics 2025-04-30 Peng Wang , Rujun Jiang , Qingyuan Kong , Laura Balzano

Citizens' assemblies are a form of democratic innovation in which a randomly selected panel of constituents deliberates on questions of public interest. We study a novel goal for the selection of panel members: maximizing the entropy of the…

Computer Science and Game Theory · Computer Science 2026-04-06 Gabriel de Azevedo , Paul Gölz

The notion of distortion in social choice problems has been defined to measure the loss in efficiency -- typically measured by the utilitarian social welfare, the sum of utilities of the participating agents -- due to having access only to…

Computer Science and Game Theory · Computer Science 2021-03-02 Elliot Anshelevich , Aris Filos-Ratsikas , Nisarg Shah , Alexandros A. Voudouris

We study deliberative social choice, where voters engage in small-group discussions to output collective preferences that are then aggregated by a social choice rule. We introduce a simple deliberation-via-matching protocol. In this…

Computer Science and Game Theory · Computer Science 2026-04-27 Kamesh Munagala , Qilin Ye , Ian Zhang

We study the problem of {\em impartial selection}, a topic that lies at the intersection of computational social choice and mechanism design. The goal is to select the most popular individual among a set of community members. The input can…

Computer Science and Game Theory · Computer Science 2021-02-19 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

Feature selection can facilitate the learning of mixtures of discrete random variables as they arise, e.g. in crowdsourcing tasks. Intuitively, not all workers are equally reliable but, if the less reliable ones could be eliminated, then…

Machine Learning · Statistics 2017-11-28 Vincent Zhao , Steven W. Zucker

We study positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score…

Computer Science and Game Theory · Computer Science 2017-11-22 Yu Cheng , Shaddin Dughmi , David Kempe

In voting with ranked ballots, each agent submits a strict ranking of the form $a \succ b \succ c \succ d$ over the alternatives, and the voting rule decides on the winner based on these rankings. Although this ballot format has desirable…

Computer Science and Game Theory · Computer Science 2026-01-06 Mehrad Abbaszadeh , Ali Ansarifar , Mohamad Latifian , Masoud Seddighin

Given an implicit $n\times n$ matrix $A$ with oracle access $x^TA x$ for any $x\in \mathbb{R}^n$, we study the query complexity of randomized algorithms for estimating the trace of the matrix. This problem has many applications in quantum…

Computational Complexity · Computer Science 2014-05-29 Karl Wimmer , Yi Wu , Peng Zhang

We study social welfare in one-sided matching markets where the goal is to efficiently allocate n items to n agents that each have a complete, private preference list and a unit demand over the items. Our focus is on allocation mechanisms…

Computer Science and Game Theory · Computer Science 2011-04-18 Anand Bhalgat , Deeparnab Chakrabarty , Sanjeev Khanna

Persuasion studies how a principal can influence agents' decisions via strategic information revelation --- often described as a signaling scheme --- in order to yield the most desirable equilibrium outcome. Recently, there has been a large…

Computer Science and Game Theory · Computer Science 2019-10-22 Haifeng Xu

We study high-dimensional mean estimation in a collaborative setting where data is contributed by $N$ users in batches of size $n$. In this environment, a learner seeks to recover the mean $\mu$ of a true distribution $P$ from a collection…

Machine Learning · Computer Science 2026-02-25 Maryam Aliakbarpour , Vladimir Braverman , Yuhan Liu , Junze Yin

Based on the observation that many existing discrete choice models admit a welfare function of utilities whose gradient gives the choice probability vector, we propose a new representation of discrete choice model which we call the…

Optimization and Control · Mathematics 2015-03-09 Guiyun Feng , Xiaobo Li , Zizhuo Wang
‹ Prev 1 3 4 5 6 7 10 Next ›