Suchergebnisse - Algorithmic game theory and complexity

Automating approximation analysis for Nash equilibria algorithms in two-player games von Deng, Xiaotie, Li, Dongchen, Li, Hanyu

“… Computing polynomial-time approximate Nash equilibria (NE) is a fundamental problem in algorithmic game theory, with deep connections to the complexity class TFNP …”
Volltext

On the Economics of Adversarial Machine Learning von Merkle, Florian, Samsinger, Maximilian, Schottle, Pascal, Pevny, Tomas

“… First, we extend our own game-theoretical framework such that it allows any arbitrary number of actions for both actors, and analytically determine equilibrium strategies and conditions where mixed …”
Volltext

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness von Delahaye, Jean-Paul, Zenil, Hector

“… An output frequency distribution is then computed, from which the algorithmic probability is calculated and the algorithmic complexity evaluated by way of the Levin …”
Volltext

Algorithmic solutions for maximizing shareable costs von Zou, Rong, Lin, Boyue, Uetz, Marc, Walter, Matthias

“… operative transferable utility game, or TU game. When maximizing total shareable costs, the cost shares must satisfy all constraints that define the core of a TU game, except for being budget balanced …”
Volltext

On the complexity of nucleolus computation for bipartite b-matching games von Könemann, Jochen, Toth, Justin, Zhou, Felix

“… We explore the complexity of nucleolus computation in b-matching games on bipartite graphs …”
Volltext

Algorithmic and Strategic Aspects to Integrating Demand-Side Aggregation and Energy Management Methods von Chapman, Archie C., Verbic, Gregor, Hill, David J.

“… Demand-side participation schemes are employed to alter customers' use of electrical power. The design of a complete scheme comprises two separate …”
Volltext

Almost envy-free allocations with connected bundles von Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker

Volltext

Breaking the traditional: a survey of algorithmic mechanism design applied to economic and complex environments von Chen, Qian, Wang, Xuan, Jiang, Zoe Lin, Wu, Yulin, Li, Huale, Cui, Lei, Sun, Xiaozhen

“… The mechanism design theory can be applied not only in the economy but also in many fields, such as politics and military affairs, which has important practical and strategic significance …”
Volltext

Almost envy-free allocations with connected bundles von Bilò, Vittorio, Caragiannis, Ioannis, Flammini, Michele, Igarashi, Ayumi, Monaco, Gianpiero, Peters, Dominik, Vinci, Cosimo, Zwicker, William S.

“… We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to …”
Volltext

Navigating algorithmic paradox management: the role of workplace game engagement and regulatory focus von Zhang, Zhipeng, Yin, Kui, Cai, Zijun, Liu, Guangjian

“… However, we know little about how app-workers navigate these paradoxes. Leveraging workplace game theory and regulatory focus theory, this study explores the coping …”
Volltext

The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization von Gonczarowski, Yannai A., Weinberg, S. Matthew

“… We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings …”
Volltext

On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria von Berthelsen, Marie Louisa Tølbøll, Hansen, Kristoffer Arnsfelt

“… We study the computational complexity of decision problems about Nash equilibria in m -player games …”
Volltext

Stability based on single-agent deviations in additively separable hedonic games von Brandt, Felix, Bullinger, Martin, Tappe, Leo

“… Coalition formation is a central concern in multiagent systems. A common desideratum for coalition structures is stability, defined by the absence of …”
Volltext

On the algorithmic complexity of the Mastermind game with black-peg results von Goodrich, Michael T.

“… In this paper, we study the algorithmic complexity of the Mastermind game, where results are single-color black pegs …”
Volltext

Towards an algorithmic guide to Spiral Galaxies von Fertin, Guillaume, Jamshidi, Shahrad, Komusiewicz, Christian

“… We study the one-player game Spiral Galaxies from an algorithmic viewpoint. Spiral Galaxies has been shown to be NP-hard [6 …”
Volltext

An algorithmic analysis of the Honey-Bee game von Fleischer, Rudolf, Woeginger, Gerhard J.

“… The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid …”
Volltext

The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games von Hansen, Kristoffer Arnsfelt

“… We show that for several solution concepts for finite n -player games, where n ≥ 3, the task of simply verifying its conditions is computationally equivalent to the decision problem of the existential theory of the reals …”
Volltext

Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives von Faliszewski, Piotr, Skowron, Piotr, Slinko, Arkadii, Talmon, Nimrod

“… We show that, for many top-k-counting rules, the complexity of winner determination is high …”
Volltext

Algorithmic Specified Complexity in the Game of Life von Ewert, Winston, Dembski, William, Marks, Robert J.

“… Algorithmic specified complexity (ASC) measures the degree to which an object is meaningful …”
Volltext

Computing desirable partitions in additively separable hedonic games von Aziz, Haris, Brandt, Felix, Seedig, Hans Georg

“… is simply the sum of the values he assigns to the members of his coalition. In this paper, we consider a number of solution concepts from cooperative game theory …”
Volltext