Coalitions are enclosed in { and }. You can separate coalitions anyway you like, e.g. by a comma and a space. Whitespace characters (i.e. spaces, tabs, linefeeds) are completely ignored.
Variables may contain characters
a-z, A-Z, numbers 0-9 and underscores
_. For instance,
Available operators are & and | for ∧ and ∨, respectively, and brackets (...) . The parser respects precedence of ∧ over ∨.
The input has to contain a single expression which can be split over multiple lines. These are are replaced by spaces before the expression is parsed.
Variables may contain characters
a-z
,
A-Z
, numbers
0-9
and underscores
_
. For instance,
Accepts a Boolean vector corresponding to a (minimal) winning coalition on each line. If the i-th position in the string is 1 then i-th player is in the corresponding coalition. A 0 means the opposite. Any characters except those just mentioned and newlines are ignored. Multiple newlines (after removal of non-relevant characters) are ignored.
For instance, (1,0,0,1), as well as 1001 correspond to the coalition containing player A and D when names A,B,C,D for the players are used. The players in the output are unnamed, though.
The backend (I)LP solver is .
Use Download to save the (I)LP as a file to you computer in CPLEX file format which is accepted by most (I)LP solvers. Use Solve to solve it directly. To this end, the game\'s textual description on the left is sent to a server and is solved there. Please note that the QOBDD is rebuilt on that computer so that beside the time for the solver that process might cost additional time.
Remark: It should usually be faster to minimize the quota.