English
Related papers

Related papers: Probabilistic Fixed Ballot Rules and Hybrid Domain…

200 papers

Property elicitation studies which attributes of a probability distribution can be determined by minimizing a risk. We investigate a generalization of property elicitation to imprecise probabilities (IP). This investigation is motivated by…

Machine Learning · Statistics 2025-12-01 James Bailie , Rabanus Derr

We generalize the stochastic revealed preference methodology of McFadden and Richter (1990) for finite choice sets to settings with limited consideration. Our approach is nonparametric and requires partial choice set variation. We impose a…

Theoretical Economics · Economics 2022-05-19 Nail Kashaev , Victor H. Aguiar

In recent years, mixup regularization has gained popularity as an effective way to improve the generalization performance of deep learning models by training on convex combinations of training data. While many mixup variants have been…

Machine Learning · Computer Science 2025-06-16 Yousef El-Laham , Niccolò Dalmasso , Svitlana Vyetrenko , Vamsi K. Potluru , Manuela Veloso

Building on ideas of Gurevich and Shelah for the G\"odel Class, we present a new probabilistic proof of the finite model property for the Guarded Fragment of First-Order Logic. Our proof is conceptually simple and yields the optimal…

Logic in Computer Science · Computer Science 2026-05-29 Oskar Fiuk

In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is…

Computer Science and Game Theory · Computer Science 2016-06-27 Zack Fitzsimmons

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Theoretical Economics · Economics 2021-11-17 Leandro Gorno , Alessandro Rivello

We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equation-al theories; we establish functional representation theorems; and we show…

Logic in Computer Science · Computer Science 2023-06-22 Klaus Keimel , Gordon D. Plotkin

We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…

Probability · Mathematics 2026-03-20 Arie Beresteanu , Behrooz Moosavi Rameznzadeh

We give several generalizations of Rellich's classical uniqueness theorem to unbounded domains. We give a natural half-space generalization for super-exponentially decaying inhomogeneities using real variable techniques. We also prove under…

Analysis of PDEs · Mathematics 2014-09-02 Esa V. Vesalainen

We show that \emph{No unbounded profit with bounded risk} (NUPBR) implies \emph{predictable uniform tightness} (P-UT), a boundedness property in the Emery topology which has been introduced by C. Stricker \cite{S:85}. Combining this insight…

Probability · Mathematics 2014-07-11 Christa Cuchiero , Josef Teichmann

Much work has been devoted, during the past twenty years, to using complexity to protect elections from manipulation and control. Many results have been obtained showing NP-hardness shields, and recently there has been much focus on whether…

Computer Science and Game Theory · Computer Science 2010-06-22 P. Faliszewski , E. Hemaspaandra , L. A. Hemaspaandra , J. Rothe

We have introduced and studied in [3] the class of Globalized multiplicatively pinched-Dedekind domains (GMPD domains). This class of domains could be characterized by a certain factorization property of the non-invertible ideals, (see [3,…

Commutative Algebra · Mathematics 2017-07-25 Shafiq ur Rehman

We investigate a stochastic counterpart of majority votes over finite ensembles of classifiers, and study its generalization properties. While our approach holds for arbitrary distributions, we instantiate it with Dirichlet distributions:…

Machine Learning · Computer Science 2021-10-20 Valentina Zantedeschi , Paul Viallard , Emilie Morvant , Rémi Emonet , Amaury Habrard , Pascal Germain , Benjamin Guedj

We consider voting rules in settings where voters' identities are difficult to verify. Voters can manipulate the process by casting multiple votes under different identities or abstaining from voting. Immunities to such manipulations are…

Theoretical Economics · Economics 2026-05-15 Agustin G. Bonifacio , Federico Fioravanti

We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…

Data Structures and Algorithms · Computer Science 2016-01-22 Clément L. Canonne , Ilias Diakonikolas , Themis Gouleakis , Ronitt Rubinfeld

We study finite probability theory through a category of finite probability schemes and probability-preserving maps, called \emph{bundles}. A bundle simultaneously records a quotient of a sample space, an algebra of random variables, and…

Probability · Mathematics 2026-05-20 Wai Yan Pong

In this paper, I characterize minimal stable voting rules and minimal self-stable constitutions (i.e., pairs of voting rules) for societies in which only power matters. To do so, I first let players' preference profiles over voting rules…

Theoretical Economics · Economics 2025-08-26 Héctor Hermida-Rivera

We set a framework for the study of Hardy spaces inherited by complements of analytic hypersurfaces in domains with a prior Hardy space structure. The inherited structure is a filtration, various aspects of which are studied in specific…

Complex Variables · Mathematics 2024-05-06 Anne-Katrin Gallagher , Purvi Gupta , Loredana Lanzani , Liz Vivas

One of the central economic paradigms in multi-agent systems is that agents should not be better off by acting dishonestly. In the context of collective decision-making, this axiom is known as strategyproofness and turns out to be rather…

Computer Science and Game Theory · Computer Science 2023-02-24 Felix Brand , Patrick Lederer , Sascha Tausch

We study the existence of pairwise stable allocations in matching markets with contracts and propose a domain restriction that guarantees their existence. Specifically, we define pseudo-substitutable preferences, a domain that strictly…

Theoretical Economics · Economics 2026-04-21 Nadia Guiñazú , Noelia Juarez , Paola Manasero , Pablo Neme , Jorge Oviedo