{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article9825","name":"Testing Core Membership in Public Goods Economies","abstract":"This paper develops a recent line of economic theory seeking to understand public goods economies using methods of topological analysis. Our first main result is a very clean characterization of the economy's core (the standard solution concept in public goods). Specifically, we prove that a point is in the core iff it is Pareto efficient, individually rational, and the set of points it dominates is path connected.\r\n\r\nWhile this structural theorem has a few interesting implications in economic theory, the main focus of the second part of this paper is on a particular algorithmic application that demonstrates its utility. Since the 1960s, economists have looked for an efficient computational process that decides whether or not a given point is in the core. All known algorithms so far run in exponential time (except in some artificially restricted settings). By heavily exploiting our new structure, we propose a new algorithm for testing core membership whose computational bottleneck is the solution of O(n) convex optimization problems on the utility function governing the economy. It is fairly natural to assume that convex optimization should be feasible, as it is needed even for very basic economic computational tasks such as testing Pareto efficiency. Nevertheless, even without this assumption, our work implies for the first time that core membership can be efficiently tested on (e.g.) utility functions that admit ``nice'' analytic expressions, or that appropriately defined epsilon-approximate versions of the problem are tractable (by using modern black-box epsilon-approximate convex optimization algorithms).","keywords":["Algorithmic Game Theory","Economics","Algorithms","Public Goods","Coalitional Stability"],"author":{"@type":"Person","name":"Bodwin, Greg","givenName":"Greg","familyName":"Bodwin"},"position":45,"pageStart":"45:1","pageEnd":"45:14","dateCreated":"2017-07-07","datePublished":"2017-07-07","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Bodwin, Greg","givenName":"Greg","familyName":"Bodwin"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.45","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6283","volumeNumber":80,"name":"44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)","dateCreated":"2017-07-07","datePublished":"2017-07-07","editor":[{"@type":"Person","name":"Chatzigiannakis, Ioannis","givenName":"Ioannis","familyName":"Chatzigiannakis"},{"@type":"Person","name":"Indyk, Piotr","givenName":"Piotr","familyName":"Indyk"},{"@type":"Person","name":"Kuhn, Fabian","givenName":"Fabian","familyName":"Kuhn"},{"@type":"Person","name":"Muscholl, Anca","givenName":"Anca","familyName":"Muscholl"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article9825","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6283"}}}