Filters








358 Hits in 2.6 sec

Attitude Adaptation in Satisficing Games

Matthew S. Nokleby, Wynn C. Stirling
2007 2007 IEEE Symposium on Foundations of Computational Intelligence  
Satisficing game theory is an alternative to traditional game theory which offers more flexibility in modeling players in social interactions.  ...  We present a method based on evolutionary game theory by which players may adapt their attitudes to their circumstances, allowing them to overcome dysfunction.  ...  The selectability quantifies them according to their benefits, while the rejectability quantifies them in terms of their costs.  ... 
doi:10.1109/foci.2007.372188 dblp:conf/foci/NoklebyS07 fatcat:csbn3mane5cohmczykb3x5cjoq

Attitude Adaptation in Satisficing Games

M. Nokleby, W. Stirling
2009 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
Satisficing game theory is an alternative to traditional game theory which offers more flexibility in modeling players in social interactions.  ...  We present a method based on evolutionary game theory by which players may adapt their attitudes to their circumstances, allowing them to overcome dysfunction.  ...  The selectability quantifies them according to their benefits, while the rejectability quantifies them in terms of their costs.  ... 
doi:10.1109/tsmcb.2009.2021013 pmid:19556204 fatcat:pqrl7twp5fa4tiqpdkxajwdh2u

Robust satisficing voting: why are uncertain voters biased towards sincerity?

Lior Davidovitch, Yakov Ben-Haim
2009 Public Choice  
Info-gap models are used to quantify non-probabilistic "true" (Knightian) uncertainty (Ben-Haim 2006 ). An info-gap model is an unbounded family of nested sets, U(α, u).  ...  Voting games are often compared to game-theory games with incomplete information (Harsanyi 1967) , or global games (Carlsson and van Damme 1993; Morris and Shin 2001) .  ...  In this case, a robust-satisficing voter may vote similarly to a sincere voter.  ... 
doi:10.1007/s11127-009-9565-1 fatcat:5o4vg6snovbdfbbyavo2xiz2qe

Satisficing, preferences, and social interaction: a new perspective

Wynn C. Stirling, Teppo Felin
2015 Theory and Decision  
Satisficing is a central concept in both individual and social multiagent 1 decision making.  ...  Second, we extend this notion of "neo"-satisficing into the context of social 4 or multiagent decision making and interaction, and model the social conditioning of 5 preferences in a satisficing framework  ...  0.2 0.2 0.2 u R T 0.1 0.3 0.2 0.4 u S M 0.0 0.5 0.0 0.5 u R M 0.1 0.3 0.2 0.4 Conditional satisficing games 423 As is the case with traditional game theory, the satisficing model developed with (6)  ... 
doi:10.1007/s11238-015-9531-y fatcat:vvnub7enubdvrkasu6m47ligti

Doing Our Best: Optimization and the Management of Risk

Yakov Ben-Haim
2012 Risk Analysis  
The disparate domains-economics and engineering-illuminate different aspects of the challenge of uncertainty and of the significance of robust-satisficing.  ...  We discuss the equity premium puzzle from financial economics, and explain that the puzzle can be resolved by using the strategy of satisficing rather than optimizing.  ...  Nonetheless, satisficing requirements such as the one we have discussed are quite common in engineering. U.S.  ... 
doi:10.1111/j.1539-6924.2012.01818.x pmid:22551012 fatcat:gtcno2g3y5cgrjcvh4pkkiovyu

What Makes a Good Decision? Robust Satisficing as a Normative Standard of Rational Decision Making

BARRY SCHWARTZ, YAKOV BEN-HAIM, CLIFF DACSO
2010 Journal for the Theory of Social Behaviour  
What, then, is one to do in such situations? And does robust satisficing apply? Various suggestions have been proposed for making decisions in competitive strategic games.  ...  Ben-Haim and Hipel (2002) use info-gap theory in a game-theoretic study of conflict resolution.  ... 
doi:10.1111/j.1468-5914.2010.00450.x fatcat:jbj5yafdmzd5laiki52mr37pvm

Game Theory as Psychological Investigation [chapter]

Paul A.
2013 Game Theory Relaunched  
Acknowledgement Funding for this work was through the gracious award to me by the University of Houston -Clear Lake to serve a year as one of its five distinguished University Fellows. Pantheon.  ...  And as I explain in the Beauty Game, the master strategist by removing himself from the first round of play may have masterminded a super game which remains satisficing to all only so long as no one catches  ...  (The Beauty Game represents a further difficulty because the reward of the one most beautiful girl cannot be distributed and satisficing strategies do not work as long as the unit of reward she represents  ... 
doi:10.5772/53932 fatcat:5wxroxoqmrdchmztadrqdwpzei

Socially Rational Models for Autonomous Agents

James K. Archibald, Wynn C. Stirling, Matthew S. Nokleby
2008 Open Cybernetics and Systemics Journal  
The Ultimatum game is one for which game-theoretic analysis does not correspond well to empirical data regarding human behavior; it is thus an important test case for a new theory.  ...  The satisficing approach is applied to two scenarios: the Ultimatum game and a random graph search problem.  ...  Satisficing Games A satisficing game, as defined by Stirling [34] , is a triple (G, U, p G SR ).  ... 
doi:10.2174/1874110x00802010122 fatcat:5avofm2245dutolhok3rfepyyi

Game theoretic modeling of pilot behavior during mid-air encounters [article]

Ritchie Lee, David H. Wolpert
2011 arXiv   pre-print
Rather pilots decide their actions based on all information available to them (advisory, instrument readings, visual observations).  ...  We show how to combine Bayes nets and game theory to predict the behavior of hybrid systems involving both humans and automated components.  ...  Semi net-form game is a thoroughly probabilistic model, and thus represents all quantities in the system using random variables.  ... 
arXiv:1103.5169v2 fatcat:vw74nbfdwrdynimqrpemlqlzoy

Robust Satisficing Decision Making for Unmanned Aerial Vehicle Complex Missions under Severe Uncertainty

Xiaoting Ji, Yifeng Niu, Lincheng Shen, Yong Deng
2016 PLoS ONE  
In the second, an algorithm based on robust dynamic programming is proposed to generate a robust satisficing policy, while an associated robustness evaluation algorithm is presented to evaluate the robustness  ...  Finally, through Monte Carlo simulation, the effectiveness of our algorithms is demonstrated on an UAV search mission under severe uncertainty so that the resulting policy can maximize the robustness while  ...  Itay et al [35] propose a robust satisficing approach based on the info-gap decision theory to solve the spatial search-planning problem with imprecise probabilistic data.  ... 
doi:10.1371/journal.pone.0166448 pmid:27835670 pmcid:PMC5105955 fatcat:lmw27c6lkjaebob6ke5vihbdum

QuLBIT: Quantum-Like Bayesian Inference Technologies for Cognition and Decision [article]

Catarina Moreira and Matheus Hammes and Rasim Serdar Kurdoglu and Peter Bruza
2021 arXiv   pre-print
This is achieved by exploiting quantum interference effects as a way of both quantifying and explaining the decision-maker's uncertainty.  ...  Although quantum approaches for cognition have demonstrated advantages over classical probabilistic approaches and bounded rationality models, they still lack explanatory power.  ...  It is precisely through these off-diagonal elements that, during the inference process, one is able to obtain quantum interference effects, and consequently, deviations from normative probabilistic inferences  ... 
arXiv:2006.02256v2 fatcat:vnvrphk6svdrja4leskr54sdwy

Decidability and complexity for -regular properties of stochastic systems

D. Henriques, M. Biscaia, P. Baltazar, P. Mateus
2012 Logic Journal of the IGPL  
Herein we study the probabilization of Quantified Linear Temporal Logic, which we call PQLTL.  ...  PQLTL is related with other commonly used probabilistic temporal logics (such as PLTL, PCTL and PCTL * ) that were devised only to specify properties for which model checking algorithms are amenable and  ...  PONG TM is a primitive computer game, akin to tennis, where players control a pad on each side of a screen and bounce back and forth a "ball".  ... 
doi:10.1093/jigpal/jzr054 fatcat:cu24p5v44fcnhpddbb6dmadcia

10.1162/1532443041827952

2000 Applied Physics Letters  
K satisfies most properties an information measure should satisf K(xy) + ≤ K(x) + K(y).  ...  Applications: Strategic Games, Function Minimization, Supervis Examples, Sequence Prediction, Classification.  ...  the probability distri • The bounds are valid for any bounded loss function. • We proved a bound on the time to win in games of chances  ... 
doi:10.1162/1532443041827952 fatcat:dcbki6px5ze3zdwc6vtxeytray

Shapley Facility Location Games [chapter]

Omer Ben-Porat, Moshe Tennenholtz
2017 Lecture Notes in Computer Science  
This paper introduces facility location games with probabilistic attraction, dubbed Shapley facility location games, due to a surprising connection to the Shapley value.  ...  Our third main result is a bound on the Price of Anarchy of this class of games, as well as showing the bound is tight.  ...  This paper focuses on facility location games with probabilistic attraction.  ... 
doi:10.1007/978-3-319-71924-5_5 fatcat:zenuibgab5ebze7twxdm6go6py

Shapley Facility Location Games [article]

Omer Ben-Porat, Moshe Tennenholtz
2017 arXiv   pre-print
This paper introduces facility location games with probabilistic attraction, dubbed Shapley facility location games, due to a surprising connection to the Shapley value.  ...  Our third main result is a bound on the Price of Anarchy of this class of games, as well as showing the bound is tight.  ...  This paper focuses on facility location games with probabilistic attraction.  ... 
arXiv:1709.10278v2 fatcat:qf5qindzivh2zbgaazj5blikhq
« Previous Showing results 1 — 15 out of 358 results