top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Algorithmic Game Theory [[electronic resource] ] : 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings / / edited by Berthold Vöcking
Algorithmic Game Theory [[electronic resource] ] : 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings / / edited by Berthold Vöcking
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XII, 271 p. 29 illus.)
Disciplina 519.3
Collana Information Systems and Applications, incl. Internet/Web, and HCI
Soggetto topico Computer simulation
E-commerce
Computers
Computers and civilization
Numerical analysis
Mathematical statistics
Simulation and Modeling
e-Commerce/e-business
Models and Principles
Computers and Society
Numeric Computing
Probability and Statistics in Computer Science
ISBN 3-642-41392-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Complexity of Fully Proportional Representation for Single-Crossing Electorates -- New Results on Equilibria in Strategic Candidacy -- Plurality Voting with Truth-Biased Agents -- Reliability Weighted Voting Games -- The Power of Mediation in an Extended El Farol Game -- Friend of My Friend: Network Formation with Two-Hop Benefit -- Load Rebalancing Games in Dynamic Systems with Migration Costs -- Stochastic Congestion Games with Risk-Averse Players -- Congestion Games with Player-Specific Costs Revisited -- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information -- Anti-coordination Games and Stable Graph Colorings -- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree -- Cooperative Equilibria in Iterated Social Dilemmas -- Symmetries of Quasi-Values -- Dividing Connected Chores Fairly -- On Popular Random Assignments -- Scheduling a Cascade with Opposing Influences -- Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games -- Inefficiency of Games with Social Context -- Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines -- Imperfect Best-Response Mechanisms -- Pricing Ad Slots with Consecutive Multi-unit Demand.
Record Nr. UNINA-9910484147903321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Game Theory [[electronic resource] ] : 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings / / edited by Berthold Vöcking
Algorithmic Game Theory [[electronic resource] ] : 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings / / edited by Berthold Vöcking
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XII, 271 p. 29 illus.)
Disciplina 519.3
Collana Information Systems and Applications, incl. Internet/Web, and HCI
Soggetto topico Computer simulation
E-commerce
Computers
Computers and civilization
Numerical analysis
Mathematical statistics
Simulation and Modeling
e-Commerce/e-business
Models and Principles
Computers and Society
Numeric Computing
Probability and Statistics in Computer Science
ISBN 3-642-41392-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Complexity of Fully Proportional Representation for Single-Crossing Electorates -- New Results on Equilibria in Strategic Candidacy -- Plurality Voting with Truth-Biased Agents -- Reliability Weighted Voting Games -- The Power of Mediation in an Extended El Farol Game -- Friend of My Friend: Network Formation with Two-Hop Benefit -- Load Rebalancing Games in Dynamic Systems with Migration Costs -- Stochastic Congestion Games with Risk-Averse Players -- Congestion Games with Player-Specific Costs Revisited -- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information -- Anti-coordination Games and Stable Graph Colorings -- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree -- Cooperative Equilibria in Iterated Social Dilemmas -- Symmetries of Quasi-Values -- Dividing Connected Chores Fairly -- On Popular Random Assignments -- Scheduling a Cascade with Opposing Influences -- Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games -- Inefficiency of Games with Social Context -- Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines -- Imperfect Best-Response Mechanisms -- Pricing Ad Slots with Consecutive Multi-unit Demand.
Record Nr. UNISA-996465477403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui