Search results for "approachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
128	Heather Desurvire, Charlotte Wiberg	Master of the game: assessing approachability in future game design.	CHI Extended Abstracts	2008	DBLP DOI BibTeX RDF	game approachability, method development, usability for video games, game design
57	Andrew Bragdon, Robert C. Zeleznik, Brian M. Williamson, Timothy S. Miller, Joseph J. LaViola Jr.	GestureBar: improving the approachability of gesture-based interfaces.	CHI	2009	DBLP DOI BibTeX RDF	approachability, learning, gestures, pen, disclosure
25	Chaehan So, Kyuha Jung	Approachability and Credibility of Virtual Character Faces: The Role of the Horizontal Viewing Angle.	Hum. Factors	2024	DBLP DOI BibTeX RDF
25	Darshan Chakrabarti, Julien Grand-Clément, Christian Kroer	Extensive-Form Game Solving via Blackwell Approachability on Treeplexes.	CoRR	2024	DBLP DOI BibTeX RDF
25	Princewill Okoroafor, Robert D. Kleinberg, Wen Sun	Faster Recalibration of an Online Predictor via Approachability.	AISTATS	2024	DBLP BibTeX RDF
25	Christoph Dann, Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan	Pseudonorm Approachability and Applications to Regret Minimization.	CoRR	2023	DBLP DOI BibTeX RDF
25	Princewill Okoroafor, Robert Kleinberg, Wen Sun	Faster Recalibration of an Online Predictor via Approachability.	CoRR	2023	DBLP DOI BibTeX RDF
25	Joon Kwon, Bruno Ziliotto	Blackwell's Approachability with Time-Dependent Outcome Functions and Dot Products. Application to the Big Match.	CoRR	2023	DBLP DOI BibTeX RDF
25	Christoph Dann, Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan	Pseudonorm Approachability and Applications to Regret Minimization.	ALT	2023	DBLP BibTeX RDF
25	Julien Grand-Clément, Christian Kroer	Solving optimization problems with Blackwell approachability.	CoRR	2022	DBLP BibTeX RDF
25	Joon Kwon	Refined approachability algorithms and application to regret minimization with global costs.	J. Mach. Learn. Res.	2021	DBLP BibTeX RDF
25	Sean D. Cox	Forcing Axioms, Approachability, and stationary Set Reflection.	J. Symb. Log.	2021	DBLP DOI BibTeX RDF
25	Rahman Mohammadpour, Boban Velickovic	Guessing models and the approachability ideal.	J. Math. Log.	2021	DBLP DOI BibTeX RDF
25	Evgenii Chzhen, Christophe Giraud 0002, Gilles Stoltz	A Unified Approach to Fair Online Learning via Blackwell Approachability.	CoRR	2021	DBLP BibTeX RDF
25	Gaëtan Fournier, Eden Kuperwasser, Orin Munk, Eilon Solan, Avishay Weinbaum	Approachability with constraints.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
25	Moti Gitik	Another method for constructing models of not approachability and not SCH.	Arch. Math. Log.	2021	DBLP DOI BibTeX RDF
25	Gabriele Farina, Christian Kroer, Tuomas Sandholm	Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent.	AAAI	2021	DBLP DOI BibTeX RDF
25	Evgenii Chzhen, Christophe Giraud 0002, Gilles Stoltz	A Unified Approach to Fair Online Learning via Blackwell Approachability.	NeurIPS	2021	DBLP BibTeX RDF
25	Arthur W. Apter	On weak square, approachability, the tree property, and failures of SCH in a choiceless context.	Math. Log. Q.	2020	DBLP DOI BibTeX RDF
25	Gabriele Farina, Christian Kroer, Tuomas Sandholm	Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent.	CoRR	2020	DBLP BibTeX RDF
25	Joon Kwon	Refined approachability algorithms and application to regret minimization with global costs.	CoRR	2020	DBLP BibTeX RDF
25	John Krueger	The approachability ideal without a maximal set.	Ann. Pure Appl. Log.	2019	DBLP DOI BibTeX RDF
25	Vianney Perchet, Marc Quincampoix	A differential game on Wasserstein space. Application to weak approachability with partial monitoring.	CoRR	2018	DBLP BibTeX RDF
25	János Flesch, Rida Laraki, Vianney Perchet	Approachability of convex sets in generalized quitting games.	Games Econ. Behav.	2018	DBLP DOI BibTeX RDF
25	Dileep M. Kalathil, Vivek S. Borkar, Rahul Jain 0002	Approachability in Stackelberg Stochastic Games with Vector Costs.	Dyn. Games Appl.	2017	DBLP DOI BibTeX RDF
25	Dario Bauso	Adaptation, coordination, and local interactions via distributed approachability.	Autom.	2017	DBLP DOI BibTeX RDF
25	Joon Kwon, Vianney Perchet	Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates.	AISTATS	2017	DBLP BibTeX RDF
25	Nahum Shimkin	An Online Convex Optimization Approach to Blackwell's Approachability.	J. Mach. Learn. Res.	2016	DBLP BibTeX RDF
25	János Flesch, Rida Laraki, Vianney Perchet	Approachability of convex sets in generalized quitting games.	CoRR	2016	DBLP BibTeX RDF
25	János Flesch, Rida Laraki, Vianney Perchet	Online Learning and Blackwell Approachability in Quitting Games.	COLT	2016	DBLP BibTeX RDF
25	David Lagziel, Ehud Lehrer	Approachability with delayed information.	J. Econ. Theory	2015	DBLP DOI BibTeX RDF
25	Vianney Perchet	Exponential Weight Approachability, Applications to Calibration and Regret Minimization.	Dyn. Games Appl.	2015	DBLP DOI BibTeX RDF
25	Andrey Bernstein, Nahum Shimkin	Response-based approachability with applications to generalized no-regret problems.	J. Mach. Learn. Res.	2015	DBLP BibTeX RDF
25	Dario Bauso, Giuseppe Notarstefano	Distributed n-Player Approachability and Consensus in Coalitional Games.	IEEE Trans. Autom. Control.	2015	DBLP DOI BibTeX RDF
25	Nahum Shimkin	An Online Convex Optimization Approach to Blackwell's Approachability.	CoRR	2015	DBLP BibTeX RDF
25	Vianney Perchet, Marc Quincampoix	On a Unified Framework for Approachability with Full or Partial Monitoring.	Math. Oper. Res.	2015	DBLP DOI BibTeX RDF
25	Heather Desurvire, Charlotte Wiberg	User Experience Design for Inexperienced Gamers: GAP - Game Approachability Principles.	Game User Experience Evaluation	2015	DBLP DOI BibTeX RDF
25	Veli-Pekka Eloranta, Essi Isohanni, Samuel Lahtinen, Outi Sievi-Korte	To UML or not to UML?: Empirical Study on the Approachability of Software Architecture Diagrams.	ASWEC (2)	2015	DBLP DOI BibTeX RDF
25	Shie Mannor, Vianney Perchet, Gilles Stoltz	Set-valued approachability and online learning with partial monitoring.	J. Mach. Learn. Res.	2014	DBLP BibTeX RDF
25	Vladimir V'yugin	Log-Optimal Portfolio Selection Using the Blackwell Approachability Theorem.	CoRR	2014	DBLP BibTeX RDF
25	Dileep M. Kalathil, Vivek S. Borkar, Rahul Jain 0002	A Learning Scheme for Approachability in MDPs and Stackelberg Stochastic Games.	CoRR	2014	DBLP BibTeX RDF
25	Shie Mannor, Vianney Perchet, Gilles Stoltz	Approachability in unknown games: Online learning meets multi-objective optimization.	CoRR	2014	DBLP BibTeX RDF
25	Andrey Bernstein, Shie Mannor, Nahum Shimkin	Opportunistic Approachability and Generalized No-Regret Problems.	Math. Oper. Res.	2014	DBLP DOI BibTeX RDF
25	Dileep M. Kalathil, Vivek S. Borkar, Rahul Jain 0002	Blackwell's approachability in stackelberg stochastic games: A learning version.	CDC	2014	DBLP DOI BibTeX RDF
25	Shie Mannor, Vianney Perchet, Gilles Stoltz	Approachability in unknown games: Online learning meets multi-objective optimization.	COLT	2014	DBLP BibTeX RDF
25	Vianney Perchet	Approachability, Regret and Calibration; implications and equivalences	CoRR	2013	DBLP BibTeX RDF
25	Vianney Perchet, Marc Quincampoix	On an unified framework for approachability in games with or without signals	CoRR	2013	DBLP BibTeX RDF
25	Shie Mannor, Vianney Perchet, Gilles Stoltz	A Primal Condition for Approachability with Partial Monitoring	CoRR	2013	DBLP BibTeX RDF
25	Andrey Bernstein, Nahum Shimkin	Response-Based Approachability and its Application to Generalized No-Regret Algorithms.	CoRR	2013	DBLP BibTeX RDF
25	Hyelip Lee, Yunkyung Kim, Myungsuk Kim	Come on in!: A strategic way to intend approachability to a space by using motions of a robotic partition.	RO-MAN	2013	DBLP DOI BibTeX RDF
25	Vianney Perchet, Shie Mannor	Approachability, fast and slow.	COLT	2013	DBLP BibTeX RDF
25	Shie Mannor, Vianney Perchet, Gilles Stoltz	Robust approachability and regret minimization in games with partial monitoring.	COLT	2011	DBLP BibTeX RDF
25	Jacob D. Abernethy, Peter L. Bartlett, Elad Hazan	Blackwell Approachability and No-Regret Learning are Equivalent.	COLT	2011	DBLP BibTeX RDF
25	Matus Telgarsky	Blackwell Approachability and Minimax Theory	CoRR	2011	DBLP BibTeX RDF
25	Shie Mannor, Vianney Perchet, Gilles Stoltz	Robust approachability and regret minimization in games with partial monitoring	CoRR	2011	DBLP BibTeX RDF
25	Vianney Perchet	Approachability of Convex Sets in Games with Partial Monitoring	CoRR	2011	DBLP BibTeX RDF
25	Vianney Perchet	Approachability of Convex Sets in Games with Partial Monitoring.	J. Optim. Theory Appl.	2011	DBLP DOI BibTeX RDF
25	Assaf Rinot	A relative of the approachability ideal, diamond and non-saturation.	J. Symb. Log.	2010	DBLP DOI BibTeX RDF
25	Jacob D. Abernethy, Peter L. Bartlett, Elad Hazan	Blackwell Approachability and Low-Regret Learning are Equivalent	CoRR	2010	DBLP BibTeX RDF
25	Heather Desurvire, Charlotte Wiberg	User Experience Design for Inexperienced Gamers: GAP - Game Approachability Principles.	Evaluating User Experience in Games	2010	DBLP DOI BibTeX RDF
25	Moti Gitik, John Krueger	Approachability at the second successor of a singular cardinal.	J. Symb. Log.	2009	DBLP DOI BibTeX RDF
25	Sami As Soulaimani, Marc Quincampoix, Sylvain Sorin	Repeated Games and Qualitative Differential Games: Approachability and Comparison of Strategies.	SIAM J. Control. Optim.	2009	DBLP DOI BibTeX RDF
25	Shie Mannor, John N. Tsitsiklis	Approachability in repeated games: Computational aspects and a Stackelberg variant.	Games Econ. Behav.	2009	DBLP DOI BibTeX RDF
25	Ehud Lehrer, Eilon Solan	Approachability with bounded memory.	Games Econ. Behav.	2009	DBLP DOI BibTeX RDF
25	John Krueger	Internal Approachability and Reflection.	J. Math. Log.	2008	DBLP DOI BibTeX RDF
25	Hongbin Fang, Ling Zhang	Quotient space approachability basing on measure space and fusion model of weighted graphical structure.	GrC	2006	DBLP DOI BibTeX RDF
25	Yasuo Yoshinobu	Approachability and games on posets.	J. Symb. Log.	2003	DBLP DOI BibTeX RDF
25	Ehud Lehrer	Approachability in infinite dimensional spaces.	Int. J. Game Theory	2003	DBLP DOI BibTeX RDF
25	Xavier Spinat	A Necessary and Sufficient Condition for Approachability.	Math. Oper. Res.	2002	DBLP DOI BibTeX RDF
25	Nicolas Vieille	Weak Approachability.	Math. Oper. Res.	1992	DBLP DOI BibTeX RDF
23	Vianney Perchet	Calibration and Internal No-Regret with Random Signals.	ALT	2009	DBLP DOI BibTeX RDF
23	Katri Salminen, Veikko Surakka, Jani Lylykangas, Jukka Raisamo, Rami Saarinen, Roope Raisamo, Jussi Rantala, Grigori E. Evreinov	Emotional and behavioral responses to haptic stimulation.	CHI	2008	DBLP DOI BibTeX RDF	empirical methods, quantitative
23	Shie Mannor, Nahum Shimkin	Online Learning with Variable Stage Duration.	COLT	2006	DBLP DOI BibTeX RDF
23	Annika Andersson, Åke Grönlund	e-Society Accessibility: Identifying Research Gaps.	EGOV	2003	DBLP DOI BibTeX RDF
23	Shie Mannor, Nahum Shimkin	On-Line Learning with Imperfect Monitoring.	COLT	2003	DBLP DOI BibTeX RDF
23	Michael Boyle, Christopher Edwards, Saul Greenberg	The effects of filtered video on awareness and privacy.	CSCW	2000	DBLP DOI BibTeX RDF	always-on video, awareness, media spaces, distributed groupware, casual interaction
23	Mark B. Johnson	You cannot lead a horse to water: taking charge of microcomputer support.	SIGUCCS	1987	DBLP DOI BibTeX RDF