Topic
Game complexity
About: Game complexity is a research topic. Over the lifetime, 644 publications have been published within this topic receiving 21809 citations.
Papers published on a yearly basis
1 / 2
Papers
[...]
TL;DR: Several properties of the graph-theoretic complexity are proved which show, for example, that complexity is independent of physical size and complexity depends only on the decision structure of a program.
Abstract: This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.
6,047 citations
1 Jan 2007
TL;DR: A dynamic Vickrey-Clarke-Groves mechanism that is e-cient and Bayes-Nash incentive compatible is presented, and the space of decision policies that can be truthfully implemented in a dominant strategy equilibrium is characterized.
Abstract: Online mechanisms extend the methods of mechanism design to dynamic environments with multiple agents and private information. Decisions must be made as information about types is revealed online and without knowledge of the future in the sense of online algorithms. We first consider single-valued preference domains and characterize the space of decision policies that can be truthfully implemented in a dominant strategy equilibrium. Working in a model-free environment we present truthful auctions for domains with expiring items and limited-supply items. Turning to a more general preference domain, and assuming the existence of a probabilistic model for agent types, we define a dynamic Vickrey-Clarke-Groves mechanism that is efficient and Bayes-Nash incentive compatible. We close with some thoughts about future research directions in this area.
2,813 citations
1 Jan 2007
1,209 citations
TL;DR: Several complexity measures for Boolean functions are discussed: certificate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial, and how they give bounds for the decision tree complexity of Boolean functions on deterministic, randomized, and quantum computers.
929 citations
TL;DR: Information-based complexity seeks to develop general results about the intrinsic difficulty of solving problems where available information is partial or approximate and to apply these results to specific problems.
Abstract: Information-based complexity seeks to develop general results about the intrinsic difficulty of solving problems where available information is partial or approximate and to apply these results to specific problems. This allows one to determine what is meant by an optimal algorithm in many practical situations, and offers a variety of interesting and sometimes surprising theoretical results.
827 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2023 | 3 |
| 2022 | 5 |
| 2021 | 7 |
| 2020 | 3 |
| 2019 | 6 |
| 2018 | 11 |