English
Related papers

Related papers: Probabilistic Fixed Ballot Rules and Hybrid Domain…

200 papers

For a probability distribution $P$ on an at most countable alphabet $\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\mathbb E K_{n,r}$ and probabilities $\mathbb E M_{n,r}$. Both upper and lower…

Statistics Theory · Mathematics 2016-11-17 Geoffrey Decrouez , Michael Grabchak , Quentin Paris

The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. We argue that the property of minimality…

Artificial Intelligence · Computer Science 2009-03-12 Denis Mindolin , Jan Chomicki

We analyze the relation between strategy-proofness and preference reversal in the case that agents may declare indifference. Interestingly, Berga and Moreno (2020), have recently derived preference reversal from group strategy-proofness of…

Theoretical Economics · Economics 2021-04-23 K. P. S. Bhaskara Rao , Achille Basile , Surekha Rao

We introduce new sufficient conditions for verifying stability and recurrence properties in singularly perturbed stochastic hybrid dynamical systems. Specifically, we focus on hybrid systems with deterministic continuous-time dynamics that…

Optimization and Control · Mathematics 2023-10-25 Jorge I. Poveda

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the…

Computer Science and Game Theory · Computer Science 2026-05-21 Ulle Endriss , Federico Fioravanti

We study the singularity probability of n*n random matrices with i.i.d. entries from highly biased discrete distributions. We obtain sharp non-asymptotic bounds for this probability and derive estimates on the least singular values. Our…

Probability · Mathematics 2025-12-12 Zeyan Song

We introduce a graceful approach to probabilistic inference called bounded conditioning. Bounded conditioning monotonically refines the bounds on posterior probabilities in a belief network with computation, and converges on final…

Artificial Intelligence · Computer Science 2013-04-08 Eric J. Horvitz , Jaap Suermondt , Gregory F. Cooper

We consider an economic environment with one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ refers to the winning probability of an object, and $t$ denotes the payment that the buyer makes. We consider…

Computer Science and Game Theory · Computer Science 2024-12-17 Mridu Prabal Goswami

The main purpose of the present paper is to introduce the notion of squeezing functions of bounded domains and study some properties of them. The relation to geometric and analytic structures of bounded domains will be investigated.…

Complex Variables · Mathematics 2011-11-03 Fusheng Deng , Qian Guan , Liyou Zhang

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

Computer Science and Game Theory · Computer Science 2025-09-24 Tomáš Masařík , Grzegorz Pierczyński , Piotr Skowron

This paper explores a new class of incomplete preferences -- termed ``connected preferences'' -- in which maximal domains of comparability are topologically connected. We provide necessary and sufficient conditions for continuous…

Theoretical Economics · Economics 2026-05-01 Leandro Gorno , Alessandro Rivello

We show that one-dimensional Euclidean preference profiles can not be characterized in terms of finitely many forbidden substructures. This result is in strong contrast to the case of single-peaked and single-crossing preference profiles,…

Computer Science and Game Theory · Computer Science 2015-06-15 Jiehua Chen , Kirk Pruhs , Gerhard J. Woeginger

In order to represent the preferences of a group of individuals, we introduce Probabilistic CP-nets (PCP-nets). PCP-nets provide a compact language for representing probability distributions over preference orderings. We argue that they are…

Artificial Intelligence · Computer Science 2013-09-27 Damien Bigot , Bruno Zanuttini , Helene Fargier , Jerome Mengin

It is well known that no reasonable voting rule is strategyproof. Moreover, the common Plurality rule is particularly prone to strategic behavior of the voters and empirical studies show that people often vote strategically in practice.…

Computer Science and Game Theory · Computer Science 2014-04-22 Reshef Meir , Omer Lev , Jeffrey S. Rosenschein

We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone.…

Computer Science and Game Theory · Computer Science 2025-12-05 Jannik Peters

This paper proposes normative criteria for voting rules under uncertainty about individual preferences. The criteria emphasize the importance of responsiveness, i.e., the probability that the social outcome coincides with the realized…

Theoretical Economics · Economics 2025-07-31 Satoshi Nakada , Shmuel Nitzan , Takashi Ui

It is proved that the space of differential forms with weak exterior and co-derivative, is compactly embedded into the space of square integrable differential forms. Mixed boundary conditions on weak Lipschitz domains are considered.…

Analysis of PDEs · Mathematics 2019-05-01 Sebastian Bauer , Dirk Pauly , Michael Schomburg

This paper studies probability density evolution for stochastic hybrid systems with reset maps that change the dimension of the continuous state across modes. Existing Frobenius--Perron formulations typically represent reset-induced…

Optimization and Control · Mathematics 2026-04-09 Tejaswi K. C. , Taeyoung Lee

Bayes nets are extensively used in practice to efficiently represent joint probability distributions over a set of random variables and capture dependency relations. In a seminal paper, Chickering et al. (JMLR 2004) showed that given a…

Machine Learning · Computer Science 2024-08-06 Arnab Bhattacharyya , Davin Choo , Sutanu Gayen , Dimitrios Myrisiotis

Consider Plurality with random tie-breaking. This paper uses standard axiomatic extensions of preferences over elements to preferences over sets (Kelly, Gardenfors, Responsiveness) to characterize all better-replies of a voter under…

Computer Science and Game Theory · Computer Science 2016-09-07 Reshef Meir
‹ Prev 1 3 4 5 6 7 10 Next ›