Results 31 to 40 of about 125,860 (118)
Decision Making Under Information Asymmetry: Experimental Evidence on Belief Refinements [PDF]
We explore how individuals make decisions in an operations management setting when there is information asymmetry between the firm and an outside investor. A common assumption in the signaling game literature is that beliefs among the participants in the
Buell, Ryan Williams, Schmidt, William
core
On the beliefs off the path: equilibrium refinement due to quantal response and level-k [PDF]
This paper studies the relevance of equilibrium and nonequilibrium explanations of behavior, with respects to equilibrium refinement, as players gain experience. We investigate this experimentally using an incomplete information sequential move game with
Breitmoser, Yves +2 more
core +1 more source
Generalized Backward Induction: Justification for a Folk Algorithm
I introduce axiomatically infinite sequential games that extend Kuhn’s classical framework. Infinite games allow for (a) imperfect information, (b) an infinite horizon, and (c) infinite action sets.
Marek Mikolaj Kaminski
doaj +1 more source
Weighted Modal Transition Systems [PDF]
Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention.
Bauer, Sebastian S. +5 more
core +5 more sources
Strategic behavior in non-atomic games [PDF]
In order to remedy the possible loss of strategic interaction in non-atomic games with a societal choice, this study proposes a refinement of Nash equilibrium, strategic equilibrium.
Barlo, Mehmet, Carmona, Guilherme
core +3 more sources
Inherent Addiction Mechanisms in Video Games’ Gacha
Gacha games, particularly those using Free-to-Play (F2P) models, have become increasingly popular yet controversial due to their addictive mechanics, often likened to gambling.
Sagguneswaraan Thavamuni +2 more
doaj +1 more source
Quasi-Perfect Stackelberg Equilibrium
Equilibrium refinements are important in extensive-form (i.e., tree-form) games, where they amend weaknesses of the Nash equilibrium concept by requiring sequential rationality and other beneficial properties.
Farina, Gabriele +4 more
core +1 more source
No-Regret Learning in Extensive-Form Games with Imperfect Recall [PDF]
Counterfactual Regret Minimization (CFR) is an efficient no-regret learning algorithm for decision problems modeled as extensive games. CFR's regret bounds depend on the requirement of perfect recall: players always remember information that was revealed
Marc Lanctot +5 more
core
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium
Nash equilibrium is a popular solution concept for solving imperfect-information games in practice. However, it has a major drawback: it does not preclude suboptimal play in branches of the game tree that are not reached in equilibrium.
Farina, Gabriele +2 more
core +1 more source
Tester versus Bug: A Generic Framework for Model-Based Testing via Games [PDF]
We propose a generic game-based approach for test case generation. We set up a game between the tester and the System Under Test, in such a way that test cases correspond to game strategies, and the conformance relation ioco corresponds to alternating ...
Bos, Petra van den, Stoelinga, Marielle
core +4 more sources

