z-logo
open-access-imgOpen Access
Convex Interval Games
Author(s) -
Sırma Zeynep Alparslan Gök,
R. Brânzei,
S.H. Tijs
Publication year - 2009
Publication title -
journal of applied mathematics and decision sciences
Language(s) - English
Resource type - Journals
eISSN - 1532-7612
pISSN - 1173-9126
DOI - 10.1155/2009/342089
Subject(s) - interval (graph theory) , mathematics , shapley value , regular polygon , convex set , monotonic function , core (optical fiber) , class (philosophy) , operator (biology) , convex combination , combinatorics , discrete mathematics , mathematical economics , convex optimization , game theory , computer science , mathematical analysis , geometry , artificial intelligence , telecommunications , biochemistry , chemistry , repressor , transcription factor , gene
Convex interval games are introduced and characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for convex interval games are established. The notion of population monotonic interval allocation scheme (pmias) in the interval setting is introduced and it is proved that each element of the Weber set of a convex interval game is extendable to such a pmias. A square operator is introduced which allows us to obtain interval solutions starting from the corresponding classical cooperative game theory solutions. It turns out that on the class of convex interval games the square Weber set coincides with the interval core

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom