Learning Hierarchical Object Maps Of Non-Stationary Environments With Mobile Robots Dragomir Anguelov Rahul Biswas Daphne Koller Benson Limketkai Scott Sanner Sebastian Thrun

Source URL: robots.stanford.edu

Riigi Teataja küsitlus 2015 Kokku 377 vastust 1. Kas Te kasutate Riigi Teataja võrguväljaannet (edaspidi RT)? 2. Kas olete rahul RT-ga?

Source URL: www.riigiteataja.ee

Unit Vector Games Rahul Savani∗ Bernhard von Stengel† arXiv:1501.02243v3 [cs.GT] 14 Feb 2016

Source URL: www.maths.lse.ac.uk

• Game theory
• Non-cooperative games
• LemkeHowson algorithm
• Bimatrix game
• Nash equilibrium
• Best response
• Zero-sum game
• Symmetric game
• Strategy
• Symmetric equilibrium
• Normal-form game
• Risk dominance

CLIFF-CLAVIN: Determining Geographic Focus for News Articles [Extended Abstract] Catherine D’Ignazio Rahul Bhargava

Source URL: ailab.ijs.si

Finding Concept Coverings in Aligning Ontologies of Linked Data Rahul Parundekar, Craig A. Knoblock, and Jos´e Luis Ambite Information Sciences Institute and Department of Computer Science University of Southern Califor

Source URL: www.ke.tu-darmstadt.de

Branching Programs for Tree Evaluation Mark Braverman1, Stephen Cook2 , Pierre McKenzie3 , Rahul Santhanam4 , and Dustin Wehr2 1 Microsoft Research

Source URL: www.cs.utoronto.ca

1 Here Today, Gone Tomorrow: Exploiting Transient Servers in Data Centers Rahul Singh† , Prateek Sharma, David Irwin, Prashant Shenoy, and K.K. Ramakrishnan‡ University of Massachusetts Amherst

Source URL: www.ecs.umass.edu

Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game∗ Rahul Savani and Bernhard von Stengel Department of Mathematics, London School of Economics Houghton St, London WC2A 2AE, United Kingdom email

Source URL: www.cdam.lse.ac.uk

• Game theory
• LemkeHowson algorithm
• Bimatrix game
• Nash equilibrium
• Strategy
• Symmetric game
• Best response
• Zero-sum game
• Normal-form game
• Symmetric equilibrium
• Risk dominance
• Folk theorem

Econometrica, Vol. 74, No. 2 (March, 2006), 397–429 HARD-TO-SOLVE BIMATRIX GAMES BY RAHUL SAVANI AND BERNHARD VON STENGEL1 The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bim

Source URL: www.maths.lse.ac.uk

• Game theory
• LemkeHowson algorithm
• Bimatrix game
• Nash equilibrium
• Symmetric equilibrium
• Symmetric game
• Zero-sum game
• Strategy
• Polytope
• Risk dominance
• Abstract polytope

Algorithmica: 930–969 DOIs00453Gaming Prediction Markets: Equilibrium Strategies with a Market Maker Yiling Chen · Stanko Dimitrov · Rahul Sami ·

Source URL: yiling.seas.harvard.edu