نتایج جستجو برای: maker one

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

2009
Charles Efferson Masanori Takezawa Richard McElreath

We present a new method for quantitatively documenting concerns for economic fairness. In particular we focus on the method's potential for identifying variation in prosociality within and across societies. Specifically, we conducted multiple dictator games per player in two small-scale societies. Each game presented the decision maker with a choice between an equitable and an inequitable payof...

Journal: :Theor. Comput. Sci. 2012
Xiaotie Deng Paul W. Goldberg Bo Tang Jinshan Zhang

We study double auction market design where the market maker wants to maximize its total revenue by buying low from the sellers and selling high to the buyers. We consider a Bayesian setting where buyers and sellers have independent probability distributions on the values of products on the market. For the simplest setting where each seller has one kind of item that can be sold in whole to a bu...

Journal: :Random Struct. Algorithms 2009
Heidi Gebauer Tibor Szabó

We study biased Maker/Breaker games on the edges of the complete graph, as introduced by Chvátal and Erdős. We show that Maker, occupying one edge in each of his turns, can build a spanning tree, even if Breaker occupies b ≤ (1 − o(1)) · n lnn edges in each turn. This improves a result of Beck, and is asymptotically best possible as witnessed by the Breaker-strategy of Chvátal and Erdős. We als...

Journal: :Mechanical Engineering 2000

Journal: :Electr. J. Comb. 2009
Dan Hefetz Sebastian U. Stich

We consider the fair Hamiltonian cycle Maker-Breaker game, played on the edge set of the complete graph Kn on n vertices. It is known that Maker wins this game if n is sufficiently large. We are interested in the minimum number of moves needed for Maker in order to win the Hamiltonian cycle game, and in the smallest n for which Maker has a winning strategy for this game. We prove the following ...

2017
Édouard Bonnet Serge Gaspers Antonin Lambilliotte Stefan Rümmele Abdallah Saffidine

We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows’ influential list of open problems from 1999. Previously, the problem was thought of as a natural candidate for AW[*]-completeness. Our main tool is a new fragment of first-orde...

2007
Shikha Marwah Jinhua Zhao

We show the effects of uncertainty, ecological and economic irreversibility, and endogenous learning on land preservation decisions for species conservation. We compare the optimal decisions of three types of decision makers: an experimenting decision maker who recognizes the endogeneity of information, a real options decision maker who ignores the endogeneity but recognizes the future availabi...

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

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