Universally Balanced Combinatorial Optimization Games
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to...
Main Authors: | Xiaotie Deng, Gabrielle Demange |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2010-09-01
|
Series: | Games |
Subjects: | |
Online Access: | http://www.mdpi.com/2073-4336/1/3/299/ |
Similar Items
-
Notes on the combinatorial game: graph Nim
by: Richard M. Low, et al.
Published: (2016-10-01) -
A Further Research on S-core for Interval Cooperative Games
by: Dengyuan Xie, et al.
Published: (2015-04-01) -
Exact and Monte-Carlo algorithms for combinatorial games
by: Leino, Anders
Published: (2014) -
On the parameterized complexity of finding short winning strategies in combinatorial games
by: Scott, Allan Edward Jolicoeur
Published: (2010) -
External Assistance Techniques That Target Core Game Tasks for Balancing Game Difficulty
by: Jawad Jandali Refai, et al.
Published: (2020-06-01)