Pages that link to "Item:Q5938625"
From MaRDI portal
The following pages link to On rational computability and communication complexity (Q5938625):
Displaying 10 items.
- Program equilibrium (Q705874) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Bundling equilibrium in combinatorial auctions (Q1885427) (← links)
- The complexity of resource allocation and price mechanisms under bounded rationality (Q1896683) (← links)
- A lower bound on computational complexity given by revelation mechanisms (Q1920945) (← links)
- Overcoming free riding in multi-party computations -- the anonymous case (Q2506316) (← links)
- Non-cooperative computation: Boolean functions with correctness and exclusivity (Q2570128) (← links)
- Computation in a distributed information market (Q2570129) (← links)
- (Q4016535) (← links)