On the public citation graph

Opponent Modeling in Incomplete-Information Colonel Blotto Games via a Lossless Payoff-Curve Representation

0 signed · 15 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-24777-7openalex-snapshot

Knapsack Problems

inferredcites →https://doi.org/10.1007/s00199-005-0071-5openalex-snapshot

The Colonel Blotto game

inferredcites →https://doi.org/10.1007/s00199-020-01272-2openalex-snapshot

Generalizations of the General Lotto and Colonel Blotto games

inferredcites →https://doi.org/10.1016/j.econlet.2009.06.025openalex-snapshot

A Blotto game with Incomplete Information

inferredcites →https://doi.org/10.1016/s0899-8256(02)00530-4openalex-snapshot

Three-object two-bidder simultaneous auctions: chopsticks and tetrahedra

inferredcites →https://doi.org/10.1093/oso/9780199549597.001.0001openalex-snapshot

Strategy and Dynamics in Contests

inferredcites →https://doi.org/10.1111/j.1467-9779.2012.01556.xopenalex-snapshot

Coalitional Colonel Blotto Games with Application to the Economics of Alliances

inferredcites →https://doi.org/10.1111/j.1468-0262.2005.00638.xopenalex-snapshot

Robust Mechanism Design

inferredcites →https://doi.org/10.1126/science.add4679openalex-snapshot

Mastering the game of Stratego with model-free multiagent reinforcement learning

inferredcites →https://doi.org/10.1257/jel.20181489openalex-snapshot

Information Design: A Unified Perspective

inferredcites →https://doi.org/10.1287/mnsc.14.3.159openalex-snapshot

Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model

inferredcites →https://doi.org/10.1287/moor.6.1.58openalex-snapshot

Optimal Auction Design

inferredcites →https://doi.org/10.1613/jair.4477openalex-snapshot

An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information

inferredcites →https://doi.org/10.2307/1911865openalex-snapshot

A Theory of Auctions and Competitive Bidding

inferredcites →https://doi.org/10.65109/eoaj2433openalex-snapshot

Computing optimal randomized resource allocations for massive security games

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.