Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
- DOI
- 10.48550/arxiv.2509.20919
- Published
- 2025
- Container
- Not recorded
- Publisher
- arXiv
- Open access
- yes
Credibility signals
limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- supportingOpen access status: Normalized open-access status: open.
- supportingPublication license: A publication license was supplied: https://creativecommons.org/licenses/by/4.0/legalcode. Presence improves reuse transparency, not research validity.
- cautionPublication version: Identified as a preprint; peer review and later versions may change the record.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.48550/arxiv.2509.20919,
title = {Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games},
author = {Kontogiannis, Andreas and Pollatos, Vasilis and Farina, Gabriele and Mertikopoulos, Panayotis and Panageas, Ioannis},
year = {2025},
doi = {10.48550/arxiv.2509.20919},
url = {https://doi.org/10.48550/arxiv.2509.20919}
}RIS
TY - JOUR TI - Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games AU - Kontogiannis, Andreas AU - Pollatos, Vasilis AU - Farina, Gabriele AU - Mertikopoulos, Panayotis AU - Panageas, Ioannis PY - 2025 DO - 10.48550/arxiv.2509.20919 UR - https://doi.org/10.48550/arxiv.2509.20919 ER -
APA
Andreas, K., Vasilis, P., Gabriele, F., Panayotis, M., & Ioannis, P. (2025). Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games. https://doi.org/10.48550/arxiv.2509.20919
Source records
- datacite · retrieved 2026-11-09T01:30:05.346Z