arXiv (All)
open access
A Resource Allocation Game and its Equilibrium Strategies
In this paper we propose a Bayesian game to allocate resources. In this game, there are $c$ units of resources to be allocated to $n$ players. Agent $i$ has a demand of $V_i$ units of resources and takes action $X_i$ according to a strategy function $s_i$, i.e. $X_i=s_i(V_i)$. Payoffs are se
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
- The Complexity of Nash Equilibrium in Network Congestion and Coordination Games#1117937
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- Improved Impossibility Bounds for Maximin Share Allocations#1084972
- Value-positivity for matrix games#1066576
- A Systematic Approach to Mechanism Design with Stochastic Dynamic Stability#793953
Record · ID 1012207
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