Results 271 to 280 of about 5,218 (313)
On the construction of artificial general intelligence based on the correspondence between goals and means. [PDF]
Front Artif IntellPrudkov P.
europepmc +1 more source
Does It Matter What Is Said and Who Said It? The Interpretation of Trump's and Harris' Statements Among Republican and Democrat Voters. [PDF]
Open Mind (Camb)Gotzner N.
europepmc +1 more source
Generating borderline test samples for randomness testers via intelligent optimization and evolutionary algorithms. [PDF]
Sci RepGao P, Zhang B, Wang Z, Li C.
europepmc +1 more source
Optimization in electronic markets: examples in combinatorial auctions.
Muller, Rudolf, Hoesel, Stan van
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Provably Difficult Combinatorial Games
SIAM Journal on Computing, 1979For a number of two-person combinatorial games, the problem of determining the outcome of optimal play from a given starting position (that is, of determining which player, if either, has a forced win) is shown to be complete in exponential time with respect to logspace-reducibility.
Larry J. Stockmeyer, Ashok K. Chandra
openaire +2 more sources
2008
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
On the Impact of Combinatorial Structure on Congestion Games
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. In particular, we investigate which properties of the strategy spaces of individual players ensure a polynomial convergence time.
Heiner Ackermann +2 more
openaire +2 more sources
Games with combinatorial constraints
Cybernetics and Systems Analysis, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yemets, O. A., Ustian, N. Yu.
openaire +2 more sources