Mobile Visualization: Challenges and Solution Concepts

Author(s):  
J. L. Encarnação ◽  
M. Frühauf ◽  
T. Kirste
Keyword(s):  
2011 ◽  
Author(s):  
Gleb A. Koshevoy ◽  
Dolf J. J. Talman

2016 ◽  
Author(s):  
Nail Kashaev ◽  
Bruno Salcedo

2021 ◽  
Author(s):  
Muhammad Ejaz ◽  
Stephen Joe ◽  
Chaitanya Joshi

In this paper, we use the adversarial risk analysis (ARA) methodology to model first-price sealed-bid auctions under quite realistic assumptions. We extend prior work to find ARA solutions for mirror equilibrium and Bayes Nash equilibrium solution concepts, not only for risk-neutral but also for risk-averse and risk-seeking bidders. We also consider bidders having different wealth and assume that the auctioned item has a reserve price.


2020 ◽  
Vol 15 (1) ◽  
pp. 159-197 ◽  
Author(s):  
Bhaskar Dutta ◽  
Hannu Vartiainen

Farsighted formulations of coalitional formation, for instance, by Harsanyi and Ray and Vohra, have typically been based on the von Neumann–Morgenstern stable set. These farsighted stable sets use a notion of indirect dominance in which an outcome can be dominated by a chain of coalitional “moves” in which each coalition that is involved in the sequence eventually stands to gain. Dutta and Vohra point out that these solution concepts do not require coalitions to make optimal moves. Hence, these solution concepts can yield unreasonable predictions. Dutta and Vohra restricted coalitions to hold common, history‐independent expectations that incorporate optimality regarding the continuation path. This paper extends the Dutta–Vohra analysis by allowing for history‐dependent expectations. The paper provides characterization results for two solution concepts that correspond to two versions of optimality. It demonstrates the power of history dependence by establishing nonemptyness results for all finite games as well as transferable utility partition function games. The paper also provides partial comparisons of the solution concepts to other solutions.


2020 ◽  
Vol 34 (02) ◽  
pp. 1750-1757
Author(s):  
Erman Acar ◽  
Reshef Meir

We propose a simple uncertainty modification for the agent model in normal-form games; at any given strategy profile, the agent can access only a set of “possible profiles” that are within a certain distance from the actual action profile. We investigate the various instantiations in which the agent chooses her strategy using well-known rationales e.g., considering the worst case, or trying to minimize the regret, to cope with such uncertainty. Any such modification in the behavioral model naturally induces a corresponding notion of equilibrium; a distance-based equilibrium. We characterize the relationships between the various equilibria, and also their connections to well-known existing solution concepts such as Trembling-hand perfection. Furthermore, we deliver existence results, and show that for some class of games, such solution concepts can actually lead to better outcomes.


2012 ◽  
Author(s):  
Ochuko E. Erivwo ◽  
Olayinka A. Adeleye
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document