EGTAOnline: An experiment manager for simulation-based game studies

B-A Cassell and MP Wellman Francesca Giardini and Frédéric Amblard (eds.), Multi-Agent-Based Simulation XIII, Lecture Notes in Artificial Intelligence, vol. 7838, Springer, 2013. originally presented at: 13th International Workshop…

Strategic Formation of Credit Networks

P Dandekar, A Goel, MP Wellman, and B Wiedenbeck ACM Transactions on Internet Technology 15(1): 3:1–3:41, 2015. Abstract Credit networks are an abstraction for modeling trust among agents in a network. Agents who do not directly trust each…

Scaling simulation-based game analysis through deviation-preserving reduction

B Wiedenbeck and MP Wellman Eleventh International Conference on Autonomous Agents and Multiagent Systems, June 2012. Abstract Multiagent simulation extends the reach of game-theoretic analysis to scenarios where payoff functions can be computed…

Trading Agents

MP Wellman Morgan & Claypool Publishers, Synthesis Lectures on Artificial Intelligence and Machine Learning Abstract Automated trading in electronic markets is one of the most common and consequential applications of autonomous software…

Access Point Selection under Emerging Wireless Technologies

B-A Cassell, T Alperovich, MP Wellman, and B Noble Sixth Workshop on the Economics of Networks, Systems, and Computation (NetEcon), June 2011. Abstract Users of wireless networks increasingly face a choice among multiple available access…

Asset pricing under ambiguous information: An empirical game-theoretic analysis

B-A Cassell and MP Wellman Computational and Mathematical Organization Theory 18:445–462, 2012 preliminary version presented at SpringSim Agent-Directed Simulation Symposium, April 2011. Abstract In a representative agent model, the…

Incentivizing responsible networking via introduction-based routing

G Frazier, Q Duong, MP Wellman, and E Petersen Fourth International Conference on Trust and Trustworthy Computing, June 2011. Proceedings published as McCune et al. (eds.), Lecture Notes in Computer Science #6740, Springer. Abstract The…

Strategy exploration in empirical games

Empirical analyses of complex games necessarily focus on a restricted set of strategies, and thus the value of empirical game models depends on effective methods for selectively exploring a space of strategies. We formulate an iterative framework for strategy exploration, and experimentally evaluate an array of generic exploration policies on three games: one infinite game with known analytic solution, and two relatively large empirical games generated by simulation. Policies based on iteratively finding a beneficial deviation or best response to the minimum-regret profile among previously explored strategies perform generally well on the profile-regret measure, although we find that some stochastic introduction of suboptimal responses can often lead to more effective exploration in early stages of the process. A novel formation-based policy performs well on all measures by producing low-regret approximate formations earlier than the deviation-based policies.

Strategy and Mechanism Lessons from the First Ad Auctions Trading Agent Competition

PR Jordan, MP Wellman, and G Balakrishnan Proceedings of the 11th ACM Conference on Electronic Commerce, pages 287–296, July 2010. Abstract The inaugural tournament for the Trading Agent Competition Ad Auctions game was held in July 2009.…

Algorithms for Finding Approximate Formations in Games

PR Jordan and MP Wellman Twenty-Fourth AAAI Conference on Artificial Intelligence, pages 798–804, July 2010. Copyright © 2010, AAAI. Abstract Many computational problems in game theory, such as finding Nash equilibria, are algorithmically…