Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View —

Author(s):  
Yoshio Okamoto
2013 ◽  
Vol 15 (03) ◽  
pp. 1340019 ◽  
Author(s):  
JOAQUIN SANCHEZ-SORIANO

In this paper, we review some of the literature in which different applications to engineering problems are analyzed from a game-theoretic point of view. The revision is far from exhaustive and the sole purpose of this paper is to provide an approximate state-of-the-art on this topic. Likewise, we try throughout the paper to highlight what game theory could contribute to the study of engineering problems.


2008 ◽  
Vol 11 (03) ◽  
pp. 325-343 ◽  
Author(s):  
DAMIR FILIPOVIĆ ◽  
MICHAEL KUPPER

This paper provides sufficient and necessary conditions for the existence of equilibrium pricing rules for monetary utility functions under convex consumption constraints. These utility functions are characterized by the assumption of a fully fungible numeraire asset ("cash"). Each agent's utility is nominally shifted by exactly the amount of cash added to his endowment. We find the individual maximum utility that each agent is eligible for in an equilibrium and provide a game theoretic point of view for the fair allocation of the aggregate utility.


Networks ◽  
2021 ◽  
Author(s):  
Mauro Passacantando ◽  
Giorgio Gnecco ◽  
Yuval Hadas ◽  
Marcello Sanguineti

2007 ◽  
Vol 09 (02) ◽  
pp. 215-242 ◽  
Author(s):  
Z. HUCKI ◽  
V. N. KOLOKOLTSOV

The general approach for the pricing of rainbow (or colored) options with fixed transaction costs is developed from the game theoretic point of view. The evolution of the underlying common stocks is considered in discrete time. The main result consists in the explicit calculation of the hedge price for a variety of the rainbow options including option delivering the best of J risky assets and cash, calls on the maximum of J risky assets and the multiple-strike options. The results obtained can be also used in the framework of real options.


2016 ◽  
Vol 27 (6) ◽  
pp. 1068-1107 ◽  
Author(s):  
MAURICIO GUILLERMO ◽  
ÉTIENNE MIQUEY

In this paper, we treat the specification problem in Krivine classical realizability (Krivine 2009Panoramas et synthèses27), in the case of arithmetical formulæ. In the continuity of previous works from Miquel and the first author (Guillermo 2008Jeux de réalisabilité en arithmétique classique, Ph.D. thesis, Université Paris 7; Guillermo and Miquel 2014Mathematical Structures in Computer Science, Epub ahead of print), we characterize the universal realizers of a formula as being the winning strategies for a game (defined according to the formula). In the first sections, we recall the definition of classical realizability, as well as a few technical results. In Section 5, we introduce in more details the specification problem and the intuition of the game-theoretic point of view we adopt later. We first present a game1, that we prove to be adequate and complete if the language contains no instructions ‘quote’ (Krivine 2003Theoretical Computer Science308259–276), using interaction constants to do substitution over execution threads. We then show that as soon as the language contain ‘Quote,’ the game is no more complete, and present a second game2that is both adequate and complete in the general case. In the last Section, we draw attention to a model-theoretic point of view and use our specification result to show that arithmetical formulæ are absolute for realizability models.


1988 ◽  
Vol 53 (4) ◽  
pp. 1177-1187
Author(s):  
W. A. MacCaull

Using formally intuitionistic logic coupled with infinitary logic and the completeness theorem for coherent logic, we establish the validity, in Grothendieck toposes, of a number of well-known, classically valid theorems about fields and ordered fields. Classically, these theorems have proofs by contradiction and most involve higher order notions. Here, the theorems are each given a first-order formulation, and this form of the theorem is then deduced using coherent or formally intuitionistic logic. This immediately implies their validity in arbitrary Grothendieck toposes. The main idea throughout is to use coherent theories and, whenever possible, find coherent formulations of formulas which then allow us to call upon the completeness theorem of coherent logic. In one place, the positive model-completeness of the relevant theory is used to find the necessary coherent formulas.The theorems here deal with polynomials or rational functions (in s indeterminates) over fields. A polynomial over a field can, of course, be represented by a finite string of field elements, and a rational function can be represented by a pair of strings of field elements. We chose the approach whereby results on polynomial rings are reduced to results about the base field, because the theory of polynomial rings in s indeterminates over fields, although coherent, is less desirable from a model-theoretic point of view. Ultimately we are interested in the models.This research was originally motivated by the works of Saracino and Weispfenning [SW], van den Dries [Dr], and Bunge [Bu], each of whom generalized some theorems from algebraic geometry or ordered fields to (commutative, von Neumann) regular rings (with unity).


2015 ◽  
Vol 58 (3) ◽  
pp. 449-458 ◽  
Author(s):  
Jason Greene Boynton ◽  
Jim Coykendall

AbstractIt is well known that the factorization properties of a domain are reflected in the structure of its group of divisibility. The main theme of this paper is to introduce a topological/graph-theoretic point of view to the current understanding of factorization in integral domains. We also show that connectedness properties in the graph and topological space give rise to a generalization of atomicity.


Sign in / Sign up

Export Citation Format

Share Document