# Data Pricing on Data Pricing Problem Settings

Source: [Data Pricing on Data Pricing Problem Settings](<https://www.sota2.com/research/sota/data-pricing-on-data-pricing-problem-settings>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-03-26T13:27:19.136Z

Evaluation of algorithms for Data Pricing problems using the Data Pricing Problem Settings dataset, focusing on computational complexity metrics.

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

| Scope | Recorded value |
| --- | --- |
| Task | Data Pricing |
| Dataset (including any stated split) | Data Pricing Problem Settings |
| Metric | Time Complexity |
| Unit | OTHER |
| Direction | Lower is better |
| Results loaded | 3 of 3 |
| Coverage | All results currently returned for this benchmark |

Evaluation settings may differ between results. The original papers and recorded configurations are needed to establish comparability. A shared metric name alone does not establish an identical protocol.

## Metrics

- [Time Complexity](<https://www.sota2.com/research/sota/data-pricing-on-data-pricing-problem-settings.md?metric=Time%20Complexity>): Lower is better; unit: OTHER.

## Recorded results

| Method | Time Complexity | Result date | Report paper |
| --- | --- | --- | --- |
| Lazy Experiments via Linear Programming | 1 | Not recorded | 68fa7c451e209131cea8d4ed |
| Bergemann et al. | 2 | Not recorded | 68fa7c451e209131cea8d4ed |
| Cai and Velegkas | 2 | Not recorded | 68fa7c451e209131cea8d4ed |

### Lazy Experiments via Linear Programming

Time Complexity: 1. Result ID: 69c532b447f34ce924aeb7b1.

[Reporting paper](<https://www.sota2.com/research/paper/68fa7c451e209131cea8d4ed.md>)

[Method origin paper](<https://www.sota2.com/research/paper/68fa7c451e209131cea8d4ed.md>)

Recorded evaluation configuration: {"Buyer Types":"n","State Space Size":"Infinite","Oracle Requirements":"Requires a sampling oracle over the state space."}. This record does not assert independent reproduction.

### Bergemann et al.

Time Complexity: 2. Result ID: 69c532b447f34ce924aeb7af.

[Reporting paper](<https://www.sota2.com/research/paper/68fa7c451e209131cea8d4ed.md>)

Recorded evaluation configuration: {"Buyer Types":"n","State Space Size":"2"}. This record does not assert independent reproduction.

### Cai and Velegkas

Time Complexity: 2. Result ID: 69c532b447f34ce924aeb7b0.

[Reporting paper](<https://www.sota2.com/research/paper/68fa7c451e209131cea8d4ed.md>)

[Method origin paper](<https://www.sota2.com/research/paper/68fa68fb1e209131cea1f845.md>)

Recorded evaluation configuration: {"Buyer Types":"n","State Space Size":"Finite","Oracle Requirements":"Requires an oracle that produces the expected-utility-maximizing action for any given distribution over states."}. This record does not assert independent reproduction.

Page 1 of 1. This is an index page, not the full collection.
