default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 31 matches
- 2024
- Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. APPROX/RANDOM 2024: 54:1-54:16 - Andrea Collevecchio, Hlafo Alfie Mimun, Matteo Quattropani, Marco Scarsini:
Basins of Attraction in Two-Player Random Ordinal Potential Games. CoRR abs/2407.05460 (2024) - 2023
- Akmal Vrisna Alzuhdi, Harits Ar Rosyid, Mohammad Yasser Chuttur, Shah Nazir:
Optimizing Random Forest Algorithm to Classify Player's Memorisation via In-game Data. Knowl. Eng. Data Sci. 6(1): 103 (2023) - Gianluca Morciano, Andrea Zingoni, Giuseppe Calabrò:
Prediction of Football Players' Performance Indicators via Random Forest Algorithm. MetroXRAINE 2023: 201-205 - 2022
- Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. Comput. Complex. 31(2): 17 (2022) - Chenlan Wang, Xuan Vinh Doan, Bo Chen:
Atomic congestion games with random players: network equilibrium and the price of anarchy. J. Comb. Optim. 44(3): 2123-2142 (2022) - Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan:
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. APPROX/RANDOM 2022: 6:1-6:17 - Michael Yin, Robert Xiao:
The Reward for Luck: Understanding the Effect of Random Reward Mechanisms in Video Games on Player Experience. CHI 2022: 157:1-157:14 - 2021
- Ahmed A. Alabdel Abass, Narayan B. Mandayam, Zoran Gajic:
Evolutionary Random Access Game With Objective and Subjective Players. IEEE Access 9: 35562-35572 (2021) - Piotr Galka, Artur Strzelecki:
How Randomness Affects Player Ability to Predict the Chance to Win at PlayerUnknown's Battlegrounds (PUBG). Comput. Games J. 10(1): 1-18 (2021) - Pierre Bernhard, Marc Deschamps:
Dynamic Equilibrium with Randomly Arriving Players. Dyn. Games Appl. 11(2): 242-269 (2021) - Ran Spiegler:
Modeling players with random "data access". J. Econ. Theory 198: 105374 (2021) - Uma Girish, Ran Raz, Avishay Tal:
Quantum Versus Randomized Communication Complexity, with Efficient Players. ITCS 2021: 54:1-54:20 - 2019
- Wen An Liu, Jing Wang, Jia Wei Duan:
One-Pile Nim games with arbitrarily many random players. Discret. Appl. Math. 255: 56-74 (2019) - Sean Murphy, Rachel Player:
\delta -subgaussian Random Variables in Cryptography. ACISP 2019: 251-268 - Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. CoRR abs/1911.02218 (2019) - Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. Electron. Colloquium Comput. Complex. TR19 (2019) - 2017
- Pierre Bernhard, Marc Deschamps:
On Dynamic Games with Randomly Arriving Players. Dyn. Games Appl. 7(3): 360-385 (2017) - Carl A. Miller, Yaoyun Shi:
Randomness in nonlocal games between mistrustful players. Quantum Inf. Comput. 17(7&8): 595-610 (2017) - 2015
- Michael Krivelevich, Gal Kronenberg:
Random-Player Maker-Breaker games. Electron. J. Comb. 22(4): 4 (2015) - Ioannis Kordonis, George P. Papavassilopoulos:
LQ Nash Games With Random Entrance: An Infinite Horizon Major Player and Minor Players of Finite Horizons. IEEE Trans. Autom. Control. 60(6): 1486-1500 (2015) - Walter O. Krawec:
n-Player impartial combinatorial games with random players. Theor. Comput. Sci. 569: 1-12 (2015) - 2014
- Arkadev Chattopadhyay, Michael E. Saks:
The Power of Super-logarithmic Number of Players. APPROX-RANDOM 2014: 596-603 - Sila Temsiririrkkul, Hisamitsu Nomura, Kokolo Ikeda:
Biased random sequence generation for making common player believe it unbiased. GEM 2014: 1-8 - 2011
- Wei-Lwun Lu, Jo-Anne Ting, Kevin P. Murphy, James J. Little:
Identifying players in broadcast sports videos using conditional random fields. CVPR 2011: 3249-3256 - 2010
- Han Hu, Jian Yang, Zilei Wang, Hongsheng Xi, Xumin Wu:
Scene aware smooth playout control for portable media players over random VBR channels. IEEE Trans. Consumer Electron. 56(4): 2330-2338 (2010) - Eugene Asarin, Raphaël Chane-Yack-Fa, Daniele Varacca:
Fair Adversaries and Randomization in Two-Player Games. FoSSaCS 2010: 64-78 - 2009
- Pinyan Lu:
On 2-Player Randomized Mechanisms for Scheduling. WINE 2009: 30-41 - 2008
- Hamidou Tembine, Eitan Altman, Rachid El Azouzi, Yezekael Hayel:
Evolutionary games with random number of interacting players applied to access control. WiOpt 2008: 344-351 - 2004
- Igal Milchtaich:
Random-player games. Games Econ. Behav. 47(2): 353-388 (2004)
skipping 1 more match
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-27 05:57 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint