English
Related papers

Related papers: A Dominance Argument Against Incompleteness

200 papers

We study a modification of the so-called Parrondo's paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own…

Physics and Society · Physics 2014-10-03 L. Dinis , J. M. R. Parrondo

We identify a new type of paradoxical behavior in dice, where the sum of independent rolls produces a deceptive sequence of dominance relations. We call these ``anti-inductive dice". Consider a game with two players and two non-identical…

Probability · Mathematics 2025-03-21 Summer Eldridge , Ivo David de Oliveira , Yogev Shpilman

We prove that there is no preferential voting method satisfying the Condorcet winner and loser criteria, positive involvement (if a candidate $x$ wins in an initial preference profile, then adding a voter who ranks $x$ uniquely first cannot…

Theoretical Economics · Economics 2026-02-20 Wesley H. Holliday

Using results from neurobiology on perceptual decision making and value-based decision making, the problem of decision making between lotteries is reformulated in an abstract space where uncertain prospects are mapped to corresponding…

Neurons and Cognition · Quantitative Biology 2020-01-03 Adnan Rebei

We show that positive measure domination implies uniform almost everywhere domination and that this proof translates into a proof in the subsystem WWKL$_0$ (but not in RCA$_0$) of the equivalence of various Lebesgue measure regularity…

Logic · Mathematics 2014-08-14 Bjørn Kjos-Hanssen , Joseph S. Miller , Reed Solomon

Social decision schemes (SDSs) map the ordinal preferences of individual voters over multiple alternatives to a probability distribution over the alternatives. In order to study the axiomatic properties of SDSs, we lift preferences over…

Computer Science and Game Theory · Computer Science 2024-08-27 Felix Brandt , Patrick Lederer , Warut Suksompong

Ranking alternatives is a natural way for humans to explain their preferences. It is being used in many settings, such as school choice, course allocations and residency matches. In some cases, several `items' are given to each participant.…

Computer Science and Game Theory · Computer Science 2022-12-06 Erel Segal-Halevi , Haris Aziz , Avinatan Hassidim

We study the effectiveness of iterated elimination of strictly-dominated actions in random games. We show that dominance solvability of games is vanishingly small as the number of at least one player's actions grows. Furthermore,…

Theoretical Economics · Economics 2021-05-25 Noga Alon , Kirill Rudov , Leeat Yariv

We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information set, which is the set of profiles of the nonmanipulators…

Artificial Intelligence · Computer Science 2011-06-28 Vincent Conitzer , Toby Walsh , Lirong Xia

In a recent paper [1], it has been claimed that the outcomes of a quantum coin toss which is idealized as an infinite binary sequence is 1-random. We also defend the correctness of this claim and assert that the outcomes of quantum…

General Physics · Physics 2021-06-16 İnanç Şahin

Richman games are zero-sum games, where in each turn players bid in order to determine who will play next [Lazarus et al.'99]. We extend the theory to impartial general-sum two player games called \emph{bidding games}, showing the existence…

Computer Science and Game Theory · Computer Science 2018-08-13 Gil Kalai , Reshef Meir , Moshe Tennenholtz

A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is available: for some pairs no comparison is given in the graph.…

Optimization and Control · Mathematics 2019-06-20 László Csató , Lajos Rónyai

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

We deal with coalitional games possessing strictly positive values. Individually rational allocations of such a game has clear fractional interpretations. Many concepts, including the long-existing core and other stability notions more…

Theoretical Economics · Economics 2023-04-24 Jian Yang

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 prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2-competitive for welfare maximization with coverage valuations, unless $NP = RP$. Since the Greedy algorithm is known to be…

Data Structures and Algorithms · Computer Science 2013-01-31 Michael Kapralov , Ian Post , Jan Vondrak

Any solvency regime for financial institutions should be aligned with the fundamental objectives of regulation: protecting liability holders and securing the stability of the financial system. The first objective leads to consider…

Risk Management · Quantitative Finance 2016-04-05 Pablo Koch-Medina , Cosimo Munari , Mario Sikic

Equal opportunity is central to the concept of meritocracy. Opportunity and leadership should go to the people most qualified by performance, and not on the basis of arbitrary or irrelevant attributes. This principle is arguably most…

Physics and Society · Physics 2022-11-16 Emanuela Barzi , S. James Gates, , Roxanne Springer

We analyze the Vickrey mechanism for auctions of multiple identical goods when the players have both Knightian uncertainty over their own valuations and incomplete preferences. In this model, the Vickrey mechanism is no longer…

Computer Science and Game Theory · Computer Science 2015-04-27 Alessandro Chiesa , Silvio Micali , Zeyuan Allen Zhu

Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of options, this becomes a feasibility question: does there exist a…

Computer Science and Game Theory · Computer Science 2026-04-21 Davin Choo , Paul W. Goldberg , Nicholas Teh
‹ Prev 1 4 5 6 7 8 10 Next ›