skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The DOI auto-population feature in the Public Access Repository (PAR) will be unavailable from 4:00 PM ET on Tuesday, July 8 until 4:00 PM ET on Wednesday, July 9 due to scheduled maintenance. We apologize for the inconvenience caused.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Award ID contains: 2038416

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; (, IEEE International Conference on Computer Communication and the Internet)
    Accepted Manuscript Full Text Available
  2. ; ; (, Stochastic systems)
    Accepted Manuscript Full Text Available
  3. ; ; (, IEEE transactions on information theory)
    Accepted Manuscript Full Text Available
  4. (, Proceedings of the IEEE Conference on Decision Control)
    The work studies cooperative decentralized constrained POMDPs with asymmetric information. Using an extension of Sion's Minimax theorem for functions with positive infinity and results on weak-convergence of measures, strong duality and existence of a saddle point are established for the setting of infinite-horizon expected total discounted costs when the observations lie in a countable space, the actions are chosen from a finite space, the immediate constraint costs are bounded, and the immediate objective cost is bounded from below. 
    more » « less
    Accepted Manuscript Full Text Available
  5. ; (, Advances in Neural Information Processing Systems 36 (NeurIPS 2023))
    Accepted Manuscript Full Text Available
  6. ; ; (, Stochastic systems)
    Accepted Manuscript Full Text Available
  7. ; (, Journal of Optimization Theory and Applications)
    Full Text Available 
  8. ; ; ; ; ; (, IEEE Transactions on Smart Grid)
    Full Text Available 
  9. ; ; (, 2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton))
    Full Text Available 
  10. ; ; (, 33rd International Conference on Algorithmic Learning Theory, Proceedings of Machine Learning Research)
    Accepted Manuscript Full Text Available