Abstract
Inspired by Kalai-Samet [4] and Tijs [11], weighted average lexicographic values are introduced for share sets and for cores of cooperative games using induction arguments. Continuity properties and monotonicity properties of these weighted lexicographic values are studied. For subclasses of games (convex games, simplex games, big boss games) relations are established with weighted (exact) Shapley values.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
