3 accepted papers
Aggregate games model interdependent decision making when an agent’s utility depends on their own choice and the aggregation of everyone’s choices. We define a compactly representable subclass of aggregate games we call additive aggregate games, which encompasses popular games like congestion games,
We present algorithms of two flavors{—}one rooted in constraint satisfaction problems (CSPs) and the other in learning dynamics{—}to compute pure-strategy Nash equilibrium (PSNE) in k-dimensional congestion games (k-DCGs) and their variants. The two algorithmic approaches are driven by whether or no…
Public projects can succeed or fail for many reasons such as the feasibility of the original goal and coordination among contributors. One major reason for failure is that insufficient work leaves the project partially completed. For certain types of projects anything short of full completion is a f…