arXiv (All)
open access
Past-aware game-theoretic centrality: a framework for cardinality-constrained set-function maximization on networks
We consider cardinality-constrained optimization of set functions over the nodes of a graph. The standard greedy algorithm selects each node according to its immediate marginal contribution, a local criterion that may fail to anticipate the synergies within the final set. We introduce past-aware gam
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Efficient allocation with ordinal preference intensities#144160
- Hierarchical Possession-Aware Graph Pointer Network for Pass Receiver Selection#971469
- On Hypergraph Supports#1013362
- Betweenness centers of graphs#987100
Record · ID 984926
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive