Results for 'Minimum cost spanning tree games'

998 found
Order:
  1. Minimum cost spanning tree games and spillover stability.Ruud Hendrickx, Jacco Thijssen & Peter Borm - 2012 - Theory and Decision 73 (3):441-451.
    This article discusses interactive minimum cost spanning tree problems and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws. A new model of spillover games is presented, in which each player’s decision whether or not to cooperate is properly taken into account.
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  2.  51
    The P-value for cost sharing in minimum.Stefano Moretti, Rodica Branzei, Henk Norde & Stef Tijs - 2004 - Theory and Decision 56 (1-2):47-61.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  7
    Degree-Constrained k -Minimum Spanning Tree Problem.Pablo Adasme & Ali Dehghan Firoozabadi - 2020 - Complexity 2020:1-25.
    Let G V, E be a simple undirected complete graph with vertex and edge sets V and E, respectively. In this paper, we consider the degree-constrained k -minimum spanning tree problem which consists of finding a minimum cost subtree of G formed with at least k vertices of V where the degree of each vertex is less than or equal to an integer value d ≤ k − 2. In particular, in this paper, we consider (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  25
    Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method.Jun Ye - 2014 - Journal of Intelligent Systems 23 (3):311-324.
    Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-value neutrosophic information, the article proposes a single-valued neutrosophic minimum spanning tree clustering algorithm. Firstly, we defined a generalized distance measure between SVNSs. Then, we present an SVNMST clustering algorithm for (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  5.  10
    An Approach of Community Search with Minimum Spanning Tree Based on Node Embedding.Jinglian Liu, Daling Wang, Shi Feng & Yifei Zhang - 2021 - Complexity 2021:1-13.
    Community search is a query-oriented variant of community detection problem, and the goal is to retrieve a single community from a given set of nodes. Most of the existing community search methods adopt handcrafted features, so there are some limitations in applications. Our idea is motivated by the recent advances of node embedding. Node embedding uses deep learning method to obtain feature representation of nodes directly from graph structure automatically and offers a new method to measure the distance between two (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  38
    Finding socially best spanning trees.Andreas Darmann, Christian Klamler & Ulrich Pferschy - 2011 - Theory and Decision 70 (4):511-527.
    This article combines Social Choice Theory with Discrete Optimization. We assume that individuals have preferences over edges of a graph that need to be aggregated. The goal is to find a socially “best” spanning tree in the graph. As ranking all spanning trees is becoming infeasible even for small numbers of vertices and/or edges of a graph, our interest lies in finding algorithms that determine a socially “best” spanning tree in a simple manner. This problem (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7. Wisdom of crowds in minimum spanning tree problems.Sheng Kung Michael Yi, Mark Steyvers, Michael D. Lee & Matthew Dry - 2010 - In S. Ohlsson & R. Catrambone (eds.), Proceedings of the 32nd Annual Conference of the Cognitive Science Society. Cognitive Science Society.
  8.  14
    Traditional Sporting Games as Emotional Communities: The Case of Alcover and Moll’s Catalan–Valencian–Balearic Dictionary.Antoni Costes, Jaume March-Llanes, Verónica Muñoz-Arroyave, Sabrine Damian-Silva, Rafael Luchoro-Parrilla, Cristòfol Salas-Santandreu, Miguel Pic & Pere Lavega-Burgués - 2021 - Frontiers in Psychology 11.
    Learning to live together is the central concern of education everywhere in the world. Traditional sporting games provide interpersonal experiences that shape miniature communities charged with emotional meanings. The objective of this study was to analyze the ethnomotor features of TSG in three Catalan-speaking Autonomous Communities and to interpret them for constructing emotional communities. The study followed a phenomenological-interpretative paradigm. The identification of TSG was done by a hermeneutic methodological approach by using an exhaustive exploratory documentary research. We studied (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  14
    Optimization of Crude Oil Trade Structure: A Complex Network Analysis.Gaogao Dong, Ting Qing, Lixin Tian, Ruijin Du & Jingjing Li - 2021 - Complexity 2021:1-11.
    With the contradiction between supply and demand being intensified, the unreasonable crude oil trade structure has become increasingly prominent. Therefore, optimizing the supply and demand structure of the global crude oil trade is an urgent problem, which has become one of the crucial factors affecting the energy strategy and economic development of each country. This paper builds an optimization model that aims at minimizing crude oil trade costs based on the complex network theory. Meanwhile, an optimal solution generation approach is (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  6
    Application of Improved Interactive Multimodel Algorithm in Player Trajectory Feature Matching.Xi Du, Qi Ao & Lu Qi - 2021 - Complexity 2021:1-13.
    The original target tracking algorithm based on a single model has long been unable to meet the complex and changeable characteristics of the target, and then there are problems such as poor tracking accuracy, target loss, and model mismatch. The interactive multimodel algorithm uses multiple motion models to track the target, obtains the degree of adaptation between the actual motion state of the target and each model according to the calculated likelihood function, and then combines the updated weight values of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  10
    The Emotional States Elicited in a Human Tower Performance: Case Study.Sabrine Damian-Silva, Carles Feixa, Queralt Prat, Rafael Luchoro-Parrilla, Miguel Pic, Aaron Rillo-Albert, Unai Sáez de Ocáriz, Antoni Costes & Pere Lavega-Burgués - 2021 - Frontiers in Psychology 12.
    Human Towers are one of the most representative traditional sporting games in Catalonia, recognized in 2010 as Intangible Cultural Heritage by the United Nations Organization for Education, Science and Culture. The objective of this research was to study the emotional states elicited by a representative performance of the colla de Castellers de Lleida. This research is based on an ethnographic case study, with mixed methods in which 17 key informants voluntarily participated. Participant observation was used; the data were recorded (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  9
    Punishing the weakest link - Voluntary sanctions and efficient coordination in the minimum effort game.Fabrice Le Lec, Astrid Matthey & Ondřej Rydval - 2023 - Theory and Decision 95 (3):429-456.
    Using a laboratory experiment, we examine whether voluntary sanctions induce subjects to coordinate more efficiently in a repeated minimum-effort game. While most groups first experience Pareto inferior coordination in a baseline treatment, the level of effort increases substantially once ex post sanctioning opportunities are introduced, that is, when one can assign costly punishment points to other group members to reduce their payoffs. We compare the effect of this voluntary punishment possibility with the effect of ex post costless communication, which (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. The Wisdom of the Crowd in Combinatorial Problems.Sheng Kung Michael Yi, Mark Steyvers, Michael D. Lee & Matthew J. Dry - 2012 - Cognitive Science 36 (3):452-470.
    The “wisdom of the crowd” phenomenon refers to the finding that the aggregate of a set of proposed solutions from a group of individuals performs better than the majority of individual solutions. Most often, wisdom of the crowd effects have been investigated for problems that require single numerical estimates. We investigate whether the effect can also be observed for problems where the answer requires the coordination of multiple pieces of information. We focus on combinatorial problems such as the planar Euclidean (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  14.  16
    Costs of Distrust: The Virtuous Cycle of Tax Compliance in Jordan.Fadi Alasfour - 2019 - Journal of Business Ethics 155 (1):243-258.
    Tax compliance has been extensively researched. Yet, the classic question ‘why do people pay taxes?’ remains unanswered. In Jordan, tax evasion is widespread. The state and citizens have been trapped in a continuous hide-and-seek game, which has taken the form of a virtuous cycle. This paper investigates tax evasion along with the most noticeable features of the Jordanian tax system. It also highlights how the virtuous cycle of tax evasion has been established and what could possibly be a way out (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15.  54
    Graph Analysis of EEG Functional Connectivity Networks During a Letter-Speech Sound Binding Task in Adult Dyslexics.Gorka Fraga-González, Dirk J. A. Smit, Melle J. W. Van der Molen, Jurgen Tijms, Cornelis J. Stam, Eco J. C. De Geus & Maurits W. Van der Molen - 2021 - Frontiers in Psychology 12.
    We performed an EEG graph analysis on data from 31 typical readers and 24 dyslexics, recorded while they were engaged in an audiovisual task and during resting-state. The task simulates reading acquisition as participants learned new letter-sound mappings via feedback. EEG data was filtered for the delta, theta, alpha, and beta bands. We computed the Phase Lag Index to provide an estimate of the functional connectivity between all pairs of electrodes per band. Then, networks were constructed using a Minimum (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  64
    The temporal organization of functional brain connectivity is abnormal in schizophrenia but does not correlate with symptomatology.Walter Schoen, Jae Seung Chang, UnCheol Lee, Petr Bob & George A. Mashour - 2011 - Consciousness and Cognition 20 (4):1050-1054.
    Previous work employing graph theory and nonlinear analysis has found increased spatial and temporal disorder, respectively, of functional brain connectivity in schizophrenia. We present a new method combining graph theory and nonlinear techniques that measures the temporal disorder of functional brain connections. Multichannel electroencephalographic data were windowed and functional networks were reconstructed using the minimum spanning trees of correlation matrices. Using a method based on Shannon entropy, we found elevated connection entropy in gamma activity of patients with schizophrenia; (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  6
    Performance Optimization Method of Community Sports Facilities Configuration Based on Linear Planning Model.Xuefeng Tan, Chenggen Guo, Pu Sun & Shaojie Zhang - 2022 - Complexity 2022:1-7.
    The conventional community sports facility allocation methods have high minimum costs, and a new community sports facility allocation performance optimization method is designed based on a linear programming model in order to reduce the performance capital investment. The standardized community sports facility allocation performance objective function is established, and a pairwise model is built to divide the feasible and optimal solutions, and the feasible solutions and their constraints are found out. Establish a community sports facility configuration performance optimization model, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  11
    Bounded rationality for relaxing best response and mutual consistency: the quantal hierarchy model of decision making.Benjamin Patrick Evans & Mikhail Prokopenko - 2023 - Theory and Decision 96 (1):71-111.
    While game theory has been transformative for decision making, the assumptions made can be overly restrictive in certain instances. In this work, we investigate some of the underlying assumptions of rationality, such as mutual consistency and best response, and consider ways to relax these assumptions using concepts from level-k reasoning and quantal response equilibrium (QRE) respectively. Specifically, we propose an information-theoretic two-parameter model called the quantal hierarchy model, which can relax both mutual consistency and best response while still approximating level-k, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  5
    Optimizing Network Controllability with Minimum Cost.Xiao Wang & Linying Xiang - 2021 - Complexity 2021:1-13.
    In this paper, the issue of optimally modifying the structure of a directed network to guarantee its structural controllability is investigated. Given a directed network, in order to obtain a structurally controllable system, a framework for finding the minimum number of directed edges that need to be added to the network is proposed. After we get these edge-addition configurations, we further calculate the network cost of each optimization scheme and choose the one with the minimum cost. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  12
    A note on efficient minimum cost adjustment sets in causal graphical models.Andrea Rotnitzky & Ezequiel Smucler - 2022 - Journal of Causal Inference 10 (1):174-189.
    We study the selection of adjustment sets for estimating the interventional mean under an individualized treatment rule. We assume a non-parametric causal graphical model with, possibly, hidden variables and at least one adjustment set composed of observable variables. Moreover, we assume that observable variables have positive costs associated with them. We define the cost of an observable adjustment set as the sum of the costs of the variables that comprise it. We show that in this setting there exist adjustment (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  21.  17
    Number of Spanning Trees in the Sequence of Some Graphs.Jia-Bao Liu & S. N. Daoud - 2019 - Complexity 2019:1-22.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  22. Growth units construction in trees: A stochastic approach.Ph Reffye, E. Elguero & E. Costes - 1991 - Acta Biotheoretica 39 (3-4).
    Trees architectural study shows gradients in the meristematic activity. This activity is described by the number of internodes per growth unit, which is considered as the output of a dynamic random process. Several species were observed, which led us to propose and then estimate some mathematical models. Computing the functioning of a tree in a given environment therefore involves finding the probability function of the meristems and following the evolution of the parameters of this law along the botanical gradients (...)
     
    Export citation  
     
    Bookmark   3 citations  
  23.  13
    The Laplacian Spectrum, Kirchhoff Index, and the Number of Spanning Trees of the Linear Heptagonal Networks.Jia-Bao Liu, Jing Chen, Jing Zhao & Shaohui Wang - 2022 - Complexity 2022:1-10.
    Let H n be the linear heptagonal networks with 2 n heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of H n, we utilize the method of decompositions. Thus, the Laplacian spectrum of H n is created by eigenvalues of a pair of matrices: L A and L S of order numbers 5 n + 1 and 4 n + 1 n! / r! n − r!, respectively. On the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  15
    The Costs of Purposeful Games: When Building a Tool Means Building a Market.Martha Sue Karnes & Tristin Brynn Hooker - 2021 - American Journal of Bioethics 21 (6):59-60.
    In their Target Article, “Design Bioethics: A Theoretical Framework and Argument for Innovation in Bioethics Research,” Pavarini et al. argue for the potential of digital tools—particularly...
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  20
    A factorial analysis of verbal learning tasks.Paul A. Games - 1962 - Journal of Experimental Psychology 63 (1):1.
  26.  31
    Expanding Network Analysis Tools in Psychological Networks: Minimal Spanning Trees, Participation Coefficients, and Motif Analysis Applied to a Network of 26 Psychological Attributes.Srebrenka Letina, Tessa F. Blanken, Marie K. Deserno & Denny Borsboom - 2019 - Complexity 2019:1-27.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  74
    Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
    Game trees (or extensive-form games) were first defined by von Neumann and Morgenstern in 1944. In this paper we examine the use of game trees for representing Bayesian decision problems. We propose a method for solving game trees using local computation. This method is a special case of a method due to Wilson for computing equilibria in 2-person games. Game trees differ from decision trees in the representations of information constraints and uncertainty. We compare the game tree (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  28.  45
    Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.
    A statement of hyperarithmetic analysis is a sentence of second order arithmetic S such that for every Y⊆ω, the minimum ω-model containing Y of RCA0 + S is HYP, the ω-model consisting of the sets hyperarithmetic in Y. We provide an example of a mathematical theorem which is a statement of hyperarithmetic analysis. This statement, that we call INDEC, is due to Jullien [13]. To the author's knowledge, no other already published, purely mathematical statement has been found with this (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  29. The End Times of Philosophy.François Laruelle - 2012 - Continent 2 (3):160-166.
    Translated by Drew S. Burk and Anthony Paul Smith. Excerpted from Struggle and Utopia at the End Times of Philosophy , (Minneapolis: Univocal Publishing, 2012). THE END TIMES OF PHILOSOPHY The phrase “end times of philosophy” is not a new version of the “end of philosophy” or the “end of history,” themes which have become quite vulgar and nourish all hopes of revenge and powerlessness. Moreover, philosophy itself does not stop proclaiming its own death, admitting itself to be half dead (...)
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  30. Contemporary legal philosophising: Schmitt, Kelsen, Lukács, Hart, & law and literature, with Marxism's dark legacy in Central Europe (on teaching legal philosophy in appendix).Csaba Varga - 2013 - Budapest: Szent István Társulat.
    Reedition of papers in English spanning from 1986 to 2009 /// Historical background -- An imposed legacy -- Twentieth century contemporaneity -- Appendix: The philosophy of teaching legal philosophy in Hungary /// HISTORICAL BACKGROUND -- PHILOSOPHY OF LAW IN CENTRAL & EASTERN EUROPE: A SKETCH OF HISTORY [1999] 11–21 // PHILOSOPHISING ON LAW IN THE TURMOIL OF COMMUNIST TAKEOVER IN HUNGARY (TWO PORTRAITS, INTERWAR AND POSTWAR: JULIUS MOÓR & ISTVÁN LOSONCZY) [2001–2002] 23–39: Julius Moór 23 / István Losonczy 29 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  31.  5
    A non-stressful vision-based method for weighing live lambs.Virginia Riego del Castillo, Lidia Sánchez-González, Laura Fernández, Ruben Rebollar & Enrique Samperio - forthcoming - Logic Journal of the IGPL.
    Accurate measurement of livestock weight is a primary indicator in the meat industry to increase the economic gain. In lambs, the weight of a live animal is still usually estimated manually using traditional scales, resulting in a tedious process for the experienced assessor and stressful for the animal. In this paper, we propose a solution to this problem using computer vision techniques; thus, the proposed procedure estimates the weight of a lamb by analysing its zenithal image without interacting with the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  7
    Shard cinema.Evan Calder Williams - 2017 - London: Repeater Books, an imprint of Watkins Media.
    Shard cinema tells an expansive story of how moving images have changed in the last three decades, and how they have changed us along with them, rewiring the ways we watch, fight, and navigate an unsteady world. In a set of interrelated essays that range from the writings of early factory workers to the distributed sight of contemporary surveillance, Williams argues for deep links between the images we see and the hidden labors frozen into them, exploring how even the apparently (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  37
    Communication, leadership and coordination failure.Lu Dong, Maria Montero & Alex Possajennikov - 2018 - Theory and Decision 84 (4):557-584.
    We investigate the limits of communication and leadership in avoiding coordination failure in minimum effort games. Our environment is challenging, with low benefits of coordination relative to the effort cost. We consider two leader types: cheap-talk leader-communicators who suggest an effort level, and first-mover leaders who lead by example. Both types of leadership have some ability to increase effort in groups with no history, but are insufficient in groups with a history of low effort. Using the strategy (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34. Greek Returns: The Poetry of Nikos Karouzos.Nick Skiadopoulos & Vincent W. J. Van Gerven Oei - 2011 - Continent 1 (3):201-207.
    continent. 1.3 (2011): 201-207. “Poetry is experience, linked to a vital approach, to a movement which is accomplished in the serious, purposeful course of life. In order to write a single line, one must have exhausted life.” —Maurice Blanchot (1982, 89) Nikos Karouzos had a communist teacher for a father and an orthodox priest for a grandfather. From his four years up to his high school graduation he was incessantly educated, reading the entire private library of his granddad, comprising mainly (...)
    No categories
     
    Export citation  
     
    Bookmark  
  35.  5
    Ambiguity and price competition.R. R. Routledge & R. A. Edwards - 2020 - Theory and Decision 88 (2):231-256.
    There are few models of price competition in a homogeneous-good market which permit general asymmetries of information amongst the sellers. This work studies a price game with discontinuous payoffs in which both costs and market demand are ex ante uncertain. The sellers evaluate uncertain profits with maximin expected utilities exhibiting ambiguity aversion. The buyers in the market are permitted to split between sellers tieing at the minimum price in arbitrary ways which may be deterministic or random. The role of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  7
    A game‐theoretic proof of Shelah's theorem on labeled trees.Trevor M. Wilson - 2020 - Mathematical Logic Quarterly 66 (2):190-194.
    We give a new proof of a theorem of Shelah which states that for every family of labeled trees, if the cardinality κ of the family is much larger (in the sense of large cardinals) than the cardinality λ of the set of labels, more precisely if the partition relation holds, then there is a homomorphism from one labeled tree in the family to another. Our proof uses a characterization of such homomorphisms in terms of games.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  31
    Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
    Trees are natural generalizations of ordinals and this is especially apparent when one tries to find an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of this paper is to introduce new methods in the study of an ordering between trees whose analogue is the usual ordering between ordinals. For example, one of the methods is the tree-analogue of the successor operation on the ordinals.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  38.  27
    Trees and Ehrenfeucht–Fraı̈ssé games.Jouko Väänänen & Stevo Todorcevic - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
    Trees are natural generalizations of ordinals and this is especially apparent when one tries to find an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of this paper is to introduce new methods in the study of an ordering between trees whose analogue is the usual ordering between ordinals. For example, one of the methods is the tree-analogue of the successor operation on the ordinals.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  39.  9
    Searching game trees under a partial order.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1996 - Artificial Intelligence 82 (1-2):237-257.
  40. Games, trees and deontic logic.Bartosz Brożek - 2011 - In Jerzy Stelmach & Wojciech Załuski (eds.), Game Theory and the Law. Copernicus Center Press.
     
    Export citation  
     
    Bookmark  
  41.  89
    Values for rooted-tree and sink-tree digraph games and sharing a river.Anna B. Khmelnitskaya - 2010 - Theory and Decision 69 (4):657-669.
    We introduce values for rooted-tree and sink-tree digraph games axiomatically and provide their explicit formula representation. These values may be considered as natural extensions of the lower equivalent and upper equivalent solutions for line-graph games studied in van den Brink et al. (Econ Theory 33:349–349, 2007). We study the distribution of Harsanyi dividends. We show that the problem of sharing a river with a delta or with multiple sources among different agents located at different levels along (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  6
    Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
  43.  34
    Games and trees in infinitary logic: A survey.Jouko Väänänen - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 105--138.
  44. Maximum Shannon Entropy, Minimum Fisher Information, and an Elementary Game.Shunlong Luo - 2002 - Foundations of Physics 32 (11):1757-1772.
    We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  32
    Chain models, trees of singular cardinality and dynamic ef-games.Mirna Džamonja & Jouko Väänänen - 2011 - Journal of Mathematical Logic 11 (1):61-85.
    Let κ be a singular cardinal. Karp's notion of a chain model of size κ is defined to be an ordinary model of size κ along with a decomposition of it into an increasing union of length cf. With a notion of satisfaction and -isomorphism such models give an infinitary logic largely mimicking first order logic. In this paper we associate to this logic a notion of a dynamic EF-game which gauges when two chain models are chain-isomorphic. To this game (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  6
    A game tree with distinct leaf values which is easy for the alpha-beta algorithm.Ingo Althöfer & Bernhard Balkenhol - 1991 - Artificial Intelligence 52 (2):183-190.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  9
    The increasing cost tree search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Meir Goldenberg & Ariel Felner - 2013 - Artificial Intelligence 195 (C):470-495.
  48.  24
    Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees.Yassine Daadaa, Habib-ur Rehman, Asif Jamshed & Muhammad Atif Tahir - 2015 - Journal of Intelligent Systems 24 (4):479-489.
    In a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  49.  16
    Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.
  50.  10
    Pathology on game trees revisited, and an alternative to minimaxing.Dana S. Nau - 1983 - Artificial Intelligence 21 (1-2):221-244.
1 — 50 / 998