The following pages link to Moshe Tennenholtz (Q192116):
Displaying 50 items.
- Constrained multi-object auctions and \(b\)-matching (Q294790) (← links)
- On the value of using group discounts under price competition (Q460621) (← links)
- On fair division of a homogeneous good (Q485780) (← links)
- Revenue and reserve prices in a probabilistic single item auction (Q513288) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Congestion games with failures (Q642974) (← links)
- Program equilibrium (Q705874) (← links)
- Walking in circles (Q712279) (← links)
- Bayesian ignorance (Q714780) (← links)
- Efficient learning equilibrium (Q814627) (← links)
- Strong mediated equilibrium (Q834404) (← links)
- Mediators in position auctions (Q834851) (← links)
- Congestion games with load-dependent failures: Identical resources (Q834859) (← links)
- A note on competitive diffusion through social networks (Q991758) (← links)
- Learning equilibrium as a generalization of learning to optimize (Q1028933) (← links)
- Two-terminal routing games with unknown active players (Q1045998) (← links)
- On stable social laws and qualitative equilibria (Q1274287) (← links)
- Distributed games (Q1300674) (← links)
- Dynamic non-Bayesian decision making in multi-agent systems (Q1306755) (← links)
- Convention evolution in organizations and markets (Q1366532) (← links)
- Determination of social laws for multi-agent mobilization (Q1389600) (← links)
- On the emergence of social conventions: modeling, analysis, and simulations (Q1391350) (← links)
- Modeling agents as qualitative decision makers (Q1391353) (← links)
- (Q1575181) (redirect page) (← links)
- Choosing social laws for multi-agent systems: Minimality and simplicity (Q1575182) (← links)
- \(k\)-price auctions (Q1577958) (← links)
- A near-optimal polynomial time algorithm for learning in certain classes of stochastic games (Q1583226) (← links)
- Tractable combinatorial auctions and \(b\)-matching (Q1614868) (← links)
- Bidding games and efficient allocations (Q1756335) (← links)
- \(k\)-price auctions: revenue inequalities, utility equivalence, and competition in auction design (Q1770136) (← links)
- Bundling equilibrium in combinatorial auctions (Q1885427) (← links)
- Fair imposition (Q1886294) (← links)
- Off-line reasoning for on-line efficiency: knowledge bases (Q2171259) (← links)
- Taxed congestion games with failures (Q2268914) (← links)
- Multi-issue social learning (Q2306258) (← links)
- Fault tolerant mechanism design (Q2389683) (← links)
- Sequential commitment games (Q2411532) (← links)
- Overcoming free riding in multi-party computations -- the anonymous case (Q2506316) (← links)
- Non-cooperative computation: Boolean functions with correctness and exclusivity (Q2570128) (← links)
- On social laws for artificial agent societies: off-line design (Q2675279) (← links)
- Approximately optimal mechanism design via differential privacy (Q2826057) (← links)
- The Asymmetric Matrix Partition Problem (Q2937740) (← links)
- Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? (Q2937756) (← links)
- Walrasian Equilibrium with Few Buyers (Q2938656) (← links)
- Economical Graph Discovery (Q2941419) (← links)
- Chasing Ghosts: Competing with Stateful Policies (Q2968152) (← links)
- Invitation games and the price of stability (Q2988870) (← links)
- Sequential decision making with vector outcomes (Q2988880) (← links)
- Mechanism Design with Strategic Mediators (Q2989044) (← links)
- 10.1162/153244303765208377 (Q3044104) (← links)
