arXiv subjects

Miklós Pintér

Publications and source records attributed to Miklós Pintér.

6 recordsLinked to original sources

arXiv2026

Consistent Beliefs without Common Prior

In a strand of the literature, it is assumed that the common prior has full support; that is, every type of every player is assigned positive probability. Morris (1991,1994) established an epistemological-behavioral duality characterisation of the common prior with full support, showing that a finite type space admits such a prior if and only if it contains no acceptable bet. This result forms the basis of the present paper. The paper makes three contributions: (1) The characterisation of Morris (1991,Morris1994) is extended to infinite type spaces. (2) The extension is robust: it does not depend on whether the infinite model applies countably additive or purely additive probabilities as beliefs. (3) The analysis implies that the notion of a real common prior-understood as a single probability distribution or a set of probability distributions-is not necessarily meaningful.

econ.TH↗

arXiv2024

TU-games with utilities: the prenucleolus and its characterization set

TU-games with utility functions are considered. Generalizations of the prenucleolus, essential coalitions and the core: the u-prenucleolus, u-essential coalitions and the u-core respectively are introduced. We show that u-essential coalitions form a characterisation set for the u-prenucleolus in case of games with nonempty u-core.

math.OC↗

arXiv2022

Simulating nonlocal no-signaling boxes

We present a computer framework to simulate two-party boxes that exhibit nonclassical no-signaling correlations through a Web-based application programming interface (RESTful Web API). Unlike real quantum-based correlations, the simulated ones are not instantaneous and are created via communication with a trusted server. They can, however, be useful in a number of applications, including e.g. teaching the use of nonlocal correlations, designing and testing infocommunication systems, and engineering software interfaces for new quantum hardware. We demonstrate the use of the API via the simple implementation of the Clauser-Horne-Shimony-Holt game. Up to our knowledge no such a framework has been implemented or proposed thus far.

quant-ph↗

arXiv2022

The $κ$-core and the $κ$-balancedness of TU games

We consider transferable utility cooperative games with infinitely many players. In particular, we generalize the notions of core and balancedness, and also the Bondareva-Shapley Theorem for infinite TU-games with and without restricted cooperation, to the cases where the core consists of $κ$-additive set functions. Our generalized Bondareva-Shapley Theorem extends previous results by Bondareva (1963), Shapley (1967), Schmeidler (1967), Faigle (1989), Kannai (1969), Kannai (1992), Pinter(2011) and Bartl and Pintér (2022).

math.OC↗

arXiv2022

On Balanced Games with Infinitely Many Players: Revisiting Schmeidler's Result

We consider transferable utility cooperative games with infinitely many players and the core understood in the space of bounded additive set functions. We show that, if a game is bounded below, then its core is non-empty if and only if the game is balanced. This finding is a generalization of Schmeidler's (1967) original result ``On Balanced Games with Infinitely Many Players'', where the game is assumed to be non-negative. We furthermore demonstrate that, if a game is not bounded below, then its core might be empty even though the game is balanced; that is, our result is tight. We also generalize Schmeidler's (1967) result to the case of restricted cooperation too.

math.OC↗

arXiv2020

Ex ante versus ex post equilibria in classical Bayesian games with a nonlocal resource

We analyze the difference between ex ante and ex post equilibria in classical games played with the assistance of a nonlocal (quantum or no-signaling) resource. In physics, the playing of these games is known as performing bipartite Bell-type experiments. By analyzing the Clauser-Horn-Shimony-Holt game, we find a constructive procedure to find two-person Bayesian games with a nonlocal (i.e. no-signaling, and, in many cases, quantum) advantage. Most games of this kind known from the literature can be constructed along this principle, and share the property that their relevant ex ante equilibria are ex post equilibria as well. We introduce a new type of game, based on the Bell-theorem by Vértesi and Bene, which does not have the latter property: the ex ante and ex post equilibria differ.

quant-ph↗