Countries citing papers authored by Darse Billings
Since
Specialization
Citations
This map shows the geographic impact of Darse Billings's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Darse Billings with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Darse Billings more than expected).
This network shows the impact of papers produced by Darse Billings. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Darse Billings. The network helps show where Darse Billings may publish in the future.
Co-authorship network of co-authors of Darse Billings
This figure shows the co-authorship network connecting the top 25 collaborators of Darse Billings.
A scholar is included among the top collaborators of Darse Billings based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Darse Billings. Darse Billings is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
16 of 16 papers shown
1.
Bowling, Michael, Nolan Bard, Darse Billings, et al.. (2009). A demonstration of the Polaris poker system. Adaptive Agents and Multi-Agents Systems. 1391–1392.4 indexed citations
2.
Zinkevich, Martin, et al.. (2006). Optimal unbiased estimators for evaluating agent performance. National Conference on Artificial Intelligence. 573–578.14 indexed citations
Billings, Darse, Aaron Davidson, Neil Burch, et al.. (2004). Game tree search with adaptation in stochastic imperfect information games.1 indexed citations
7.
Billings, Darse, Neil Burch, Aaron Davidson, et al.. (2003). Approximating game-theoretic optimal strategies for full-scale poker. International Joint Conference on Artificial Intelligence. 661–668.129 indexed citations
Billings, Darse, Aaron Davidson, Jonathan Schaeffer, & Duane Szafron. (2002). The challenge of poker. Artificial Intelligence. 134(1-2). 201–240.156 indexed citations
10.
Billings, Darse, Lourdes Peña‐Castillo, Jonathan Schaeffer, & Duane Szafron. (2001). Learning to play strong poker. Nova Science Publishers, Inc. eBooks. 225–242.13 indexed citations
Billings, Darse, Lourdes Peña‐Castillo, Jonathan Schaeffer, & Duane Szafron. (1999). Using probabilistic knowledge and simulation to play poker. National Conference on Artificial Intelligence. 697–703.34 indexed citations
14.
Billings, Darse, et al.. (1999). Using Selective-Sampling Simulations in Poker.11 indexed citations
15.
Billings, Darse, et al.. (1998). Opponent modeling in poker. National Conference on Artificial Intelligence. 493–499.89 indexed citations
16.
Billings, Darse, et al.. (1998). Poker as a Testbed for Machine Intelligence Research.7 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.