default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames P. Bailey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]James P. Bailey, Craig A. Tovey:
Impact of Tie-Breaking on the Manipulability of Elections. AAMAS 2024: 105-113- [i10]James P. Bailey, Bahar Cavdar, Yanling Chang:
Analyzing Wage Theft in Day Labor Markets via Principal Agent Models. CoRR abs/2410.09305 (2024) - [i9]Ran Hu, James P. Bailey:
On the Approximability of the Yolk in the Spatial Model of Voting. CoRR abs/2410.10788 (2024) - [i8]James P. Bailey:
On the Uniqueness of Nash Equilibria in Multiagent Matrix Games. CoRR abs/2410.16548 (2024) - 2023
- [j4]James P. Bailey
:
On the dimension of the set of yolk centers. Oper. Res. Lett. 51(6): 717-722 (2023) - 2021
- [j3]James P. Bailey, Alex Nash, Craig A. Tovey, Sven Koenig:
Path-length analysis for grid-based path planning. Artif. Intell. 301: 103560 (2021) - [j2]Sunhwa Park, James P. Bailey, Hans J. Pasman, Qingsheng Wang, Mahmoud M. El-Halwagi:
Fast, easy-to-use, machine learning-developed models of prediction of flash point, heat of combustion, and lower and upper flammability limits for inherently safer design. Comput. Chem. Eng. 155: 107524 (2021) - [i7]James P. Bailey, Craig A. Tovey:
Conditions for Stability in Strategic Matching. CoRR abs/2108.04381 (2021) - [i6]James P. Bailey, Sai Ganesh Nagarajan, Georgios Piliouras:
Stochastic Multiplicative Weights Updates in Zero-Sum Games. CoRR abs/2110.02134 (2021) - [i5]James P. Bailey:
O(1/T) Time-Average Convergence in a Generalization of Multiagent Zero-Sum Games. CoRR abs/2110.02482 (2021) - 2020
- [c5]James P. Bailey, Gauthier Gidel, Georgios Piliouras:
Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent. COLT 2020: 391-407
2010 – 2019
- 2019
- [c4]James P. Bailey, Georgios Piliouras:
Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System. AAMAS 2019: 233-241 - [c3]James P. Bailey, Georgios Piliouras:
Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes. NeurIPS 2019: 12977-12987 - [i4]James P. Bailey, Georgios Piliouras:
Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System. CoRR abs/1903.01720 (2019) - [i3]James P. Bailey, Georgios Piliouras:
Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes. CoRR abs/1905.04532 (2019) - [i2]James P. Bailey, Gauthier Gidel, Georgios Piliouras:
Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent. CoRR abs/1907.04392 (2019) - 2018
- [c2]James P. Bailey, Georgios Piliouras:
Multiplicative Weights Update in Zero-Sum Games. EC 2018: 321-338 - 2015
- [c1]James P. Bailey, Craig A. Tovey, Tansel Uras, Sven Koenig, Alex Nash:
Path Planning on Grids: The Effect of Vertex Placement on Path Length. AIIDE 2015: 108-114 - 2012
- [j1]James P. Bailey, Mark A. Iwen, Craig V. Spencer:
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions. SIAM J. Matrix Anal. Appl. 33(1): 263-289 (2012) - 2011
- [i1]James P. Bailey, Mark A. Iwen, Craig V. Spencer:
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions. CoRR abs/1105.6138 (2011)
Coauthor Index
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.
last updated on 2025-01-09 12:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
