نتایج جستجو برای: reduced game excess function dynamic result

تعداد نتایج: 2692016  

2004
Pieter Spronck Ida Sprinkhuizen-Kuyper

“Difficulty scaling” is the automatic adaptation of a game, to adapt the challenge a game poses to a human player. In general, a game of which the challenge level matches the skill of the human player (i.e., an “even game”) is experienced as more entertaining than a game that is either too easy or too hard. In practice, when difficulty scaling is implemented in a game, it only adapts a few para...

Journal: :J. Economic Theory 2010
Bhaskar Dutta Lars Ehlers Anirban Kar

We provide new characterization results for the value of games in partition function form. In particular, we use the potential of a game to define the value. We also provide a characterization of the class of values which satisfies one form of reduced game consistency.

Journal: :International Journal of Game Theory 1987

Journal: :International Journal of Game Theory 1992

Journal: :Advances in Complex Systems 2009
Karol Wawrzyniak Wojciech Wislicki

We present a comprehensive study of utility function of the minority game in its efficient regime. We develop an effective description of state of the game. For the payoff function g(x) = sgn(x) we explicitly represent the game as the Markov process and prove the finitness of number of states. We also demonstrate boundedness of the utility function. Using these facts we can explain all interest...

2005
Marc Ponsen Héctor Muñoz-Avila Pieter Spronck David W. Aha

The decision-making process of computer-controlled opponents in video games is called game AI. Adaptive game AI can improve the entertainment value of games by allowing computer-controlled opponents to fix weaknesses automatically in the game AI, and to respond to changes in human-player tactics. Dynamic scripting is a reinforcement learning approach to adaptive game AI that learns, during game...

Journal: :Order 2015
Charles Dunn David Morawski Jennifer Nordstrom

The (r, d)-relaxed edge-coloring game is a two-player game using r colors played on the edge set of a graph G. We consider this game on forests and more generally, on k-degenerate graphs. If F is a forest with ∆(F ) = ∆, then the first player, Alice, has a winning strategy for this game with r = ∆− j and d ≥ 2j + 2 for 0 ≤ j ≤ ∆− 1. This both improves and generalizes the result for trees in [10...

1999
Ben Lockwood

This paper considers a class of two-player dynamic games in which each player controls a one-dimensional variable which we interpret as a level of cooperation. In the base model, there is an irreversibility constraint stating that this variable can never be reduced, only increased. It otherwise satis...es the usual discounted repeated game assumptions. Under certain restrictions on the payo¤ fu...

Journal: :Journal of lipid research 2008
Tae-Sik Park Yunying Hu Hye-Lim Noh Konstantinos Drosatos Kazue Okajima Jonathan Buchanan Joseph Tuinei Shunichi Homma Xian-Cheng Jiang E Dale Abel Ira J Goldberg

Ceramide is among a number of potential lipotoxic molecules that are thought to modulate cellular energy metabolism. The heart is one of the tissues thought to become dysfunctional due to excess lipid accumulation. Dilated lipotoxic cardiomyopathy, thought to be the result of diabetes and severe obesity, has been modeled in several genetically altered mice, including animals with cardiac-specif...

Journal: :Sci. Comput. Program. 2007
Marc J. V. Ponsen Pieter Spronck Hector Muñoz-Avila David W. Aha

Game artificial intelligence (AI) controls the decision-making process of computercontrolled opponents in computer games. Adaptive game AI (i.e., game AI that can automatically adapt the behaviour of the computer players to changes in the environment) can increase the entertainment value of computer games. Successful adaptive game AI is invariably based on the game’s domain knowledge. We show t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید