{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:43:58Z","timestamp":1725497038923},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771043"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_51","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:59:37Z","timestamp":1196665177000},"page":"469-481","source":"Crossref","is-referenced-by-count":10,"title":["Weighted Boolean Formula Games"],"prefix":"10.1007","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus W.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11549345_10","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C. \u00c1lvarez","year":"2005","unstructured":"\u00c1lvarez, C., Gabarr\u00f3, J., Serna, M.: Pure Nash Equilibria in Games with a Large Number of Actions. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 95\u2013106. Springer, Heidelberg (2005)"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0899-8256(89)90003-1","volume":"1","author":"R.J. Aumann","year":"1989","unstructured":"Aumann, R.J., Sorin, S.: Cooperation and Bounded Recall. Games and Economic Behavior\u00a01, 5\u201339 (1989)","journal-title":"Games and Economic Behavior"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/game.1997.0546","volume":"19","author":"M. Bacharach","year":"1997","unstructured":"Bacharach, M., Bernasconi, M.: An Experimental Study of the Variable Frame Theory of Focal Points. Games and Economic Behavior\u00a019, 1\u201345 (1997)","journal-title":"Games and Economic Behavior"},{"key":"51_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-3-540-72870-2_22","volume-title":"AAIM 2007","author":"V. Bil\u00f3","year":"2007","unstructured":"Bil\u00f3, V.: On Satisfiability Games and the Power of Congestion Games. In: Bil\u00f3, V. (ed.) AAIM 2007. LNCS, vol.\u00a04508, pp. 231\u2013240. Springer, Heidelberg (2007)"},{"key":"51_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11801603_7","volume-title":"PRICAI 2006: Trends in Artificial Intelligence","author":"E. Bonzon","year":"2006","unstructured":"Bonzon, E., Lagasquie-Schiex, M.-C., Lang, J.: Compact Preference Representation for Boolean Games. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol.\u00a04099, pp. 41\u201350. Springer, Heidelberg (2006)"},{"key":"51_CR6","unstructured":"Bonzon, E., Lagasquie-Schiex, M.-C., Lang, J., Zanuttini, B.: Boolean Games Revisited. In: Proceedings of the 17th European Conference on Artificial Intelligence, pp. 265\u2013269 (2006)"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1004911723951","volume":"43","author":"A.M. Colman","year":"1997","unstructured":"Colman, A.M., Bacharach, M.: Payoff Dominance and the Stackelberg Heuristic. Theory and Decision\u00a043, 1\u201319 (1997)","journal-title":"Theory and Decision"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. Theoretical Computer Science\u00a0348, 226\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"51_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11786986_44","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Routing (Un-)Splittable Flow in Games with Player-Specific Linear Latency Functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 501\u2013512. Springer, Heidelberg (2006)"},{"key":"51_CR11","unstructured":"Harrenstein, P., van der Hoek, W., Meyer, J.-J., Witteveen, C.: Boolean Games. In: Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 287\u2013298 (2001)"},{"key":"51_CR12","volume-title":"A General Theory of Equilibrium Selection in Games","author":"J.C. Harsanyi","year":"1988","unstructured":"Harsanyi, J.C., Selten, R.: A General Theory of Equilibrium Selection in Games. MIT Press, Cambridge (1988)"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01770226","volume":"14","author":"E. Kalai","year":"1985","unstructured":"Kalai, E., Samet, D.: Unanimity Games and Pareto Optimality. International Journal of Game Theory\u00a014, 41\u201350 (1985)","journal-title":"International Journal of Game Theory"},{"key":"51_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01366920","volume":"11","author":"V.M. Krapchenko","year":"1971","unstructured":"Krapchenko, V.M.: Complexity of the Realization of a Linear Function in the Class of \u03c0-Circuits. Mathematical Notes of the Academy of Sciences USSR\u00a011, 70\u201376 (1971)","journal-title":"Mathematical Notes of the Academy of Sciences USSR"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Milchtaich, I., Monien, B., Tiemann, K.: Congestion Games with Player-Specific Constants. In: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (August 2007)","DOI":"10.1007\/978-3-540-74456-6_56"},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior\u00a013, 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"51_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential Games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"51_CR18","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-Cooperative Games. Annals of Mathematics\u00a054, 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"51_CR19","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0304-3975(76)90090-6","volume":"2","author":"M. Paterson","year":"1976","unstructured":"Paterson, M., Valiant, L.G.: Circuit Size is Nonlinear in Depth. Theoretical Computer Science\u00a02, 397\u2013400 (1976)","journal-title":"Theoretical Computer Science"},{"key":"51_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A Class of Games Possessing Pure Strategy Nash Equilibria. International Journal on Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal on Game Theory"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Schoenebeck, G., Vadhan, S.: The Computational Complexity of Nash Equilibria in Concisely Represented Games. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 270\u2013279 (2006)","DOI":"10.1145\/1134707.1134737"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:34Z","timestamp":1619521234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_51","relation":{},"subject":[]}}